[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 21 from proof fids-exists (previous step)

str0 ∈ sdt0, str0 ∈ sdt0[str, tree], ∀ fid. fid ∈ fids ↔ fid ∈ tree.fids, ∀ str0. str0 ∈ sdt0[str, tree] → (∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt0[str, tree][str0].fids), ∀ fid. fid ∈ fids0 ↔ fid ∈ sdt0[str0].fids, ∀ sdt1. # sdt1 < # sdt0[str, tree] → (∀ str. str ∈ sdt1 → (∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt1[str].fids)) → (∃ fids. ∀ fid0. fid0 ∈ fids ↔ fid0 ∈ sdt1.fids) ⊦ str ∈ sdt0, ∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt0[str0].fids, ∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt0.fids ∪ tree.fids

User applied rule exists right

And obtained the following new goals

Proof step 22:
str0 ∈ sdt0[str, tree], str0 ∈ sdt0, ∀ fid. fid ∈ fids0 ↔ fid ∈ sdt0[str0].fids, ∀ str0. str0 ∈ sdt0[str, tree] → (∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt0[str, tree][str0].fids), ∀ fid. fid ∈ fids ↔ fid ∈ tree.fids, ∀ sdt1. # sdt1 < # sdt0[str, tree] → (∀ str. str ∈ sdt1 → (∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt1[str].fids)) → (∃ fids. ∀ fid0. fid0 ∈ fids ↔ fid0 ∈ sdt1.fids) ⊦ str ∈ sdt0, ∀ fid. fid ∈ fids0 ↔ fid ∈ sdt0[str0].fids, ∃ fids. ∀ fid. fid ∈ fids ↔ fid ∈ sdt0.fids ∪ tree.fids

Rule argument

pos: right 2 terms: fids0 abort: F discard: T computed: T

Additional information

Used terms: fids0