ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfrlemibxssdm GIF version

Theorem tfrlemibxssdm 6598
Description: The union of 𝐵 is defined on all ordinals. Lemma for tfrlemi1 6603. (Contributed by Jim Kingdon, 18-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)
Hypotheses
Ref Expression
tfrlemisucfn.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
tfrlemisucfn.2 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
tfrlemi1.3 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))}
tfrlemi1.4 (𝜑 → 𝑥 ∈ On)
tfrlemi1.5 (𝜑 → ∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))
Assertion
Ref Expression
tfrlemibxssdm (𝜑 → 𝑥 ⊆ dom ∪ 𝐵)
Distinct variable groups:   𝑓,𝑔,ℎ,𝑤,𝑥,𝑦,𝑧,𝐴   𝑓,𝐹,𝑔,ℎ,𝑤,𝑥,𝑦,𝑧   𝜑,𝑤,𝑦   𝑤,𝐵,𝑓,𝑔,ℎ,𝑧   𝜑,𝑔,ℎ,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑓)   𝐵(𝑥, 𝑦)

Proof of Theorem tfrlemibxssdm
StepHypRef Expression
1 tfrlemi1.5 . . 3 (𝜑 → ∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))
2 tfrlemi1.4 . . . 4 (𝜑 → 𝑥 ∈ On)
3 tfrlemisucfn.2 . . . . . . . . . . . 12 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
43tfrlem3-2d 6583 . . . . . . . . . . 11 (𝜑 → (Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))
54simprd 114 . . . . . . . . . 10 (𝜑 → (𝐹‘𝑔) ∈ V)
653ad2ant1 1049 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → (𝐹‘𝑔) ∈ V)
7 vex 2824 . . . . . . . . . . . . 13 𝑧 ∈ V
8 opexg 4368 . . . . . . . . . . . . 13 ((𝑧 ∈ V ∧ (𝐹‘𝑔) ∈ V) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ V)
97, 5, 8sylancr 418 . . . . . . . . . . . 12 (𝜑 → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ V)
10 snidg 3738 . . . . . . . . . . . 12 (⟨𝑧, (𝐹‘𝑔)⟩ ∈ V → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ {⟨𝑧, (𝐹‘𝑔)⟩})
11 elun2 3397 . . . . . . . . . . . 12 (⟨𝑧, (𝐹‘𝑔)⟩ ∈ {⟨𝑧, (𝐹‘𝑔)⟩} → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
129, 10, 113syl 17 . . . . . . . . . . 11 (𝜑 → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
13123ad2ant1 1049 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
14 simp2r 1055 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → 𝑧 ∈ 𝑥)
15 simp3l 1056 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → 𝑔 Fn 𝑧)
16 onelon 4529 . . . . . . . . . . . . . . 15 ((𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) → 𝑧 ∈ On)
17 rspe 2599 . . . . . . . . . . . . . . 15 ((𝑧 ∈ On ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))
1816, 17sylan 283 . . . . . . . . . . . . . 14 (((𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))
19 tfrlemisucfn.1 . . . . . . . . . . . . . . 15 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
20 vex 2824 . . . . . . . . . . . . . . 15 𝑔 ∈ V
2119, 20tfrlem3a 6581 . . . . . . . . . . . . . 14 (𝑔 ∈ 𝐴 ↔ ∃𝑧 ∈ On (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))
2218, 21sylibr 134 . . . . . . . . . . . . 13 (((𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → 𝑔 ∈ 𝐴)
23223adant1 1046 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → 𝑔 ∈ 𝐴)
2414, 15, 233jca 1208 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → (𝑧 ∈ 𝑥 ∧ 𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴))
25 snexg 4321 . . . . . . . . . . . . . 14 (⟨𝑧, (𝐹‘𝑔)⟩ ∈ V → {⟨𝑧, (𝐹‘𝑔)⟩} ∈ V)
26 unexg 4589 . . . . . . . . . . . . . . 15 ((𝑔 ∈ V ∧ {⟨𝑧, (𝐹‘𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V)
2720, 26mpan 428 . . . . . . . . . . . . . 14 ({⟨𝑧, (𝐹‘𝑔)⟩} ∈ V → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V)
289, 25, 273syl 17 . . . . . . . . . . . . 13 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V)
29 isset 2828 . . . . . . . . . . . . 13 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V ↔ ∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
3028, 29sylib 122 . . . . . . . . . . . 12 (𝜑 → ∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
31303ad2ant1 1049 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → ∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
32 simpr3 1036 . . . . . . . . . . . . . . 15 ((𝑧 ∈ 𝑥 ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))) → ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))
33 19.8a 1643 . . . . . . . . . . . . . . . 16 ((𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})) → ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
34 rspe 2599 . . . . . . . . . . . . . . . . 17 ((𝑧 ∈ 𝑥 ∧ ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))) → ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
35 tfrlemi1.3 . . . . . . . . . . . . . . . . . 18 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))}
3635abeq2i 2349 . . . . . . . . . . . . . . . . 17 (ℎ ∈ 𝐵 ↔ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})))
3734, 36sylibr 134 . . . . . . . . . . . . . . . 16 ((𝑧 ∈ 𝑥 ∧ ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))) → ℎ ∈ 𝐵)
3833, 37sylan2 286 . . . . . . . . . . . . . . 15 ((𝑧 ∈ 𝑥 ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))) → ℎ ∈ 𝐵)
3932, 38eqeltrrd 2316 . . . . . . . . . . . . . 14 ((𝑧 ∈ 𝑥 ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐵)
40393exp2 1256 . . . . . . . . . . . . 13 (𝑧 ∈ 𝑥 → (𝑔 Fn 𝑧 → (𝑔 ∈ 𝐴 → (ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐵))))
41403imp 1224 . . . . . . . . . . . 12 ((𝑧 ∈ 𝑥 ∧ 𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴) → (ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐵))
4241exlimdv 1872 . . . . . . . . . . 11 ((𝑧 ∈ 𝑥 ∧ 𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴) → (∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐵))
4324, 31, 42sylc 62 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐵)
44 elunii 3940 . . . . . . . . . 10 ((⟨𝑧, (𝐹‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∧ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐵) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ ∪ 𝐵)
4513, 43, 44syl2anc 415 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ ∪ 𝐵)
46 opeq2 3905 . . . . . . . . . . . 12 (𝑤 = (𝐹‘𝑔) → ⟨𝑧, 𝑤⟩ = ⟨𝑧, (𝐹‘𝑔)⟩)
4746eleq1d 2307 . . . . . . . . . . 11 (𝑤 = (𝐹‘𝑔) → (⟨𝑧, 𝑤⟩ ∈ ∪ 𝐵 ↔ ⟨𝑧, (𝐹‘𝑔)⟩ ∈ ∪ 𝐵))
4847spcegv 2913 . . . . . . . . . 10 ((𝐹‘𝑔) ∈ V → (⟨𝑧, (𝐹‘𝑔)⟩ ∈ ∪ 𝐵 → ∃𝑤⟨𝑧, 𝑤⟩ ∈ ∪ 𝐵))
497eldm2 4979 . . . . . . . . . 10 (𝑧 ∈ dom ∪ 𝐵 ↔ ∃𝑤⟨𝑧, 𝑤⟩ ∈ ∪ 𝐵)
5048, 49imbitrrdi 162 . . . . . . . . 9 ((𝐹‘𝑔) ∈ V → (⟨𝑧, (𝐹‘𝑔)⟩ ∈ ∪ 𝐵 → 𝑧 ∈ dom ∪ 𝐵))
516, 45, 50sylc 62 . . . . . . . 8 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥) ∧ (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤)))) → 𝑧 ∈ dom ∪ 𝐵)
52513expia 1236 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥)) → ((𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))) → 𝑧 ∈ dom ∪ 𝐵))
5352exlimdv 1872 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ On ∧ 𝑧 ∈ 𝑥)) → (∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))) → 𝑧 ∈ dom ∪ 𝐵))
5453anassrs 404 . . . . 5 (((𝜑 ∧ 𝑥 ∈ On) ∧ 𝑧 ∈ 𝑥) → (∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))) → 𝑧 ∈ dom ∪ 𝐵))
5554ralimdva 2617 . . . 4 ((𝜑 ∧ 𝑥 ∈ On) → (∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))) → ∀𝑧 ∈ 𝑥 𝑧 ∈ dom ∪ 𝐵))
562, 55mpdan 425 . . 3 (𝜑 → (∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))) → ∀𝑧 ∈ 𝑥 𝑧 ∈ dom ∪ 𝐵))
571, 56mpd 13 . 2 (𝜑 → ∀𝑧 ∈ 𝑥 𝑧 ∈ dom ∪ 𝐵)
58 dfss3 3236 . 2 (𝑥 ⊆ dom ∪ 𝐵 ↔ ∀𝑧 ∈ 𝑥 𝑧 ∈ dom ∪ 𝐵)
5957, 58sylibr 134 1 (𝜑 → 𝑥 ⊆ dom ∪ 𝐵)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009  ∀wal 1400   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∪ cun 3218   ⊆ wss 3220  {csn 3709  ⟨cop 3712  ∪ cuni 3935  Oncon0 4508  dom cdm 4774   ↾ cres 4776  Fun wfun 5371   Fn wfn 5372  ‘cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-iord 4511  df-on 4513  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385
This theorem is used by:  tfrlemibfn  6599
  Copyright terms: Public domain W3C validator