Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz9.12lem3 Structured version   Visualization version   GIF version

Theorem tz9.12lem3 8535
 Description: Lemma for tz9.12 8536. (Contributed by NM, 22-Sep-2003.) (Revised by Mario Carneiro, 11-Sep-2015.)
Hypotheses
Ref Expression
tz9.12lem.1 𝐴 ∈ V
tz9.12lem.2 𝐹 = (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)})
Assertion
Ref Expression
tz9.12lem3 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝐴 ∈ (𝑅1‘suc suc (𝐹𝐴)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑣,𝐴   𝑥,𝐹,𝑦
Allowed substitution hints:   𝐹(𝑧,𝑣)

Proof of Theorem tz9.12lem3
StepHypRef Expression
1 tz9.12lem.2 . . . . . . . . . . 11 𝐹 = (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)})
21funmpt2 5841 . . . . . . . . . 10 Fun 𝐹
3 fveq2 6103 . . . . . . . . . . . . . . 15 (𝑣 = 𝑦 → (𝑅1𝑣) = (𝑅1𝑦))
43eleq2d 2673 . . . . . . . . . . . . . 14 (𝑣 = 𝑦 → (𝑥 ∈ (𝑅1𝑣) ↔ 𝑥 ∈ (𝑅1𝑦)))
54rspcev 3282 . . . . . . . . . . . . 13 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → ∃𝑣 ∈ On 𝑥 ∈ (𝑅1𝑣))
6 rabn0 3912 . . . . . . . . . . . . 13 ({𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅ ↔ ∃𝑣 ∈ On 𝑥 ∈ (𝑅1𝑣))
75, 6sylibr 223 . . . . . . . . . . . 12 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅)
8 intex 4747 . . . . . . . . . . . 12 ({𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅ ↔ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V)
97, 8sylib 207 . . . . . . . . . . 11 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V)
10 vex 3176 . . . . . . . . . . . 12 𝑥 ∈ V
11 eleq1 2676 . . . . . . . . . . . . . . . 16 (𝑧 = 𝑥 → (𝑧 ∈ (𝑅1𝑣) ↔ 𝑥 ∈ (𝑅1𝑣)))
1211rabbidv 3164 . . . . . . . . . . . . . . 15 (𝑧 = 𝑥 → {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)} = {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
1312inteqd 4415 . . . . . . . . . . . . . 14 (𝑧 = 𝑥 {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)} = {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
1413eleq1d 2672 . . . . . . . . . . . . 13 (𝑧 = 𝑥 → ( {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)} ∈ V ↔ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V))
151dmmpt 5547 . . . . . . . . . . . . 13 dom 𝐹 = {𝑧 ∈ V ∣ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)} ∈ V}
1614, 15elrab2 3333 . . . . . . . . . . . 12 (𝑥 ∈ dom 𝐹 ↔ (𝑥 ∈ V ∧ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V))
1710, 16mpbiran 955 . . . . . . . . . . 11 (𝑥 ∈ dom 𝐹 {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V)
189, 17sylibr 223 . . . . . . . . . 10 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → 𝑥 ∈ dom 𝐹)
19 funfvima 6396 . . . . . . . . . 10 ((Fun 𝐹𝑥 ∈ dom 𝐹) → (𝑥𝐴 → (𝐹𝑥) ∈ (𝐹𝐴)))
202, 18, 19sylancr 694 . . . . . . . . 9 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → (𝑥𝐴 → (𝐹𝑥) ∈ (𝐹𝐴)))
21 tz9.12lem.1 . . . . . . . . . . 11 𝐴 ∈ V
2221, 1tz9.12lem2 8534 . . . . . . . . . 10 suc (𝐹𝐴) ∈ On
2321, 1tz9.12lem1 8533 . . . . . . . . . . . 12 (𝐹𝐴) ⊆ On
24 onsucuni 6920 . . . . . . . . . . . 12 ((𝐹𝐴) ⊆ On → (𝐹𝐴) ⊆ suc (𝐹𝐴))
2523, 24ax-mp 5 . . . . . . . . . . 11 (𝐹𝐴) ⊆ suc (𝐹𝐴)
2625sseli 3564 . . . . . . . . . 10 ((𝐹𝑥) ∈ (𝐹𝐴) → (𝐹𝑥) ∈ suc (𝐹𝐴))
27 r1ord2 8527 . . . . . . . . . 10 (suc (𝐹𝐴) ∈ On → ((𝐹𝑥) ∈ suc (𝐹𝐴) → (𝑅1‘(𝐹𝑥)) ⊆ (𝑅1‘suc (𝐹𝐴))))
2822, 26, 27mpsyl 66 . . . . . . . . 9 ((𝐹𝑥) ∈ (𝐹𝐴) → (𝑅1‘(𝐹𝑥)) ⊆ (𝑅1‘suc (𝐹𝐴)))
2920, 28syl6 34 . . . . . . . 8 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → (𝑥𝐴 → (𝑅1‘(𝐹𝑥)) ⊆ (𝑅1‘suc (𝐹𝐴))))
3029imp 444 . . . . . . 7 (((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) ∧ 𝑥𝐴) → (𝑅1‘(𝐹𝑥)) ⊆ (𝑅1‘suc (𝐹𝐴)))
3113, 1fvmptg 6189 . . . . . . . . . . . 12 ((𝑥 ∈ V ∧ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V) → (𝐹𝑥) = {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
3210, 31mpan 702 . . . . . . . . . . 11 ( {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ V → (𝐹𝑥) = {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
338, 32sylbi 206 . . . . . . . . . 10 ({𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅ → (𝐹𝑥) = {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
34 ssrab2 3650 . . . . . . . . . . 11 {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ⊆ On
35 onint 6887 . . . . . . . . . . 11 (({𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ⊆ On ∧ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅) → {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
3634, 35mpan 702 . . . . . . . . . 10 ({𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅ → {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ∈ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
3733, 36eqeltrd 2688 . . . . . . . . 9 ({𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ≠ ∅ → (𝐹𝑥) ∈ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)})
38 fveq2 6103 . . . . . . . . . . . 12 (𝑦 = (𝐹𝑥) → (𝑅1𝑦) = (𝑅1‘(𝐹𝑥)))
3938eleq2d 2673 . . . . . . . . . . 11 (𝑦 = (𝐹𝑥) → (𝑥 ∈ (𝑅1𝑦) ↔ 𝑥 ∈ (𝑅1‘(𝐹𝑥))))
404cbvrabv 3172 . . . . . . . . . . 11 {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} = {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1𝑦)}
4139, 40elrab2 3333 . . . . . . . . . 10 ((𝐹𝑥) ∈ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} ↔ ((𝐹𝑥) ∈ On ∧ 𝑥 ∈ (𝑅1‘(𝐹𝑥))))
4241simprbi 479 . . . . . . . . 9 ((𝐹𝑥) ∈ {𝑣 ∈ On ∣ 𝑥 ∈ (𝑅1𝑣)} → 𝑥 ∈ (𝑅1‘(𝐹𝑥)))
437, 37, 423syl 18 . . . . . . . 8 ((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) → 𝑥 ∈ (𝑅1‘(𝐹𝑥)))
4443adantr 480 . . . . . . 7 (((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) ∧ 𝑥𝐴) → 𝑥 ∈ (𝑅1‘(𝐹𝑥)))
4530, 44sseldd 3569 . . . . . 6 (((𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦)) ∧ 𝑥𝐴) → 𝑥 ∈ (𝑅1‘suc (𝐹𝐴)))
4645exp31 628 . . . . 5 (𝑦 ∈ On → (𝑥 ∈ (𝑅1𝑦) → (𝑥𝐴𝑥 ∈ (𝑅1‘suc (𝐹𝐴)))))
4746com3r 85 . . . 4 (𝑥𝐴 → (𝑦 ∈ On → (𝑥 ∈ (𝑅1𝑦) → 𝑥 ∈ (𝑅1‘suc (𝐹𝐴)))))
4847rexlimdv 3012 . . 3 (𝑥𝐴 → (∃𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝑥 ∈ (𝑅1‘suc (𝐹𝐴))))
4948ralimia 2934 . 2 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∀𝑥𝐴 𝑥 ∈ (𝑅1‘suc (𝐹𝐴)))
50 r1suc 8516 . . . . 5 (suc (𝐹𝐴) ∈ On → (𝑅1‘suc suc (𝐹𝐴)) = 𝒫 (𝑅1‘suc (𝐹𝐴)))
5122, 50ax-mp 5 . . . 4 (𝑅1‘suc suc (𝐹𝐴)) = 𝒫 (𝑅1‘suc (𝐹𝐴))
5251eleq2i 2680 . . 3 (𝐴 ∈ (𝑅1‘suc suc (𝐹𝐴)) ↔ 𝐴 ∈ 𝒫 (𝑅1‘suc (𝐹𝐴)))
5321elpw 4114 . . 3 (𝐴 ∈ 𝒫 (𝑅1‘suc (𝐹𝐴)) ↔ 𝐴 ⊆ (𝑅1‘suc (𝐹𝐴)))
54 dfss3 3558 . . 3 (𝐴 ⊆ (𝑅1‘suc (𝐹𝐴)) ↔ ∀𝑥𝐴 𝑥 ∈ (𝑅1‘suc (𝐹𝐴)))
5552, 53, 543bitri 285 . 2 (𝐴 ∈ (𝑅1‘suc suc (𝐹𝐴)) ↔ ∀𝑥𝐴 𝑥 ∈ (𝑅1‘suc (𝐹𝐴)))
5649, 55sylibr 223 1 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝐴 ∈ (𝑅1‘suc suc (𝐹𝐴)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  {crab 2900  Vcvv 3173   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  ∪ cuni 4372  ∩ cint 4410   ↦ cmpt 4643  dom cdm 5038   “ cima 5041  Oncon0 5640  suc csuc 5642  Fun wfun 5798  ‘cfv 5804  𝑅1cr1 8508 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-r1 8510 This theorem is referenced by:  tz9.12  8536
 Copyright terms: Public domain W3C validator