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

Theorem r1wunlim 10768
Description: The weak universes in the cumulative hierarchy are exactly the limit ordinals. (Contributed by Mario Carneiro, 2-Jan-2017.)
Assertion
Ref Expression
r1wunlim (𝐴𝑉 → ((𝑅1𝐴) ∈ WUni ↔ Lim 𝐴))

Proof of Theorem r1wunlim
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simpr 483 . . . . . . 7 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → (𝑅1𝐴) ∈ WUni)
21wun0 10749 . . . . . 6 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → ∅ ∈ (𝑅1𝐴))
3 elfvdm 6927 . . . . . 6 (∅ ∈ (𝑅1𝐴) → 𝐴 ∈ dom 𝑅1)
42, 3syl 17 . . . . 5 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → 𝐴 ∈ dom 𝑅1)
5 r1fnon 9800 . . . . . 6 𝑅1 Fn On
65fndmi 6653 . . . . 5 dom 𝑅1 = On
74, 6eleqtrdi 2836 . . . 4 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → 𝐴 ∈ On)
8 eloni 6375 . . . 4 (𝐴 ∈ On → Ord 𝐴)
97, 8syl 17 . . 3 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → Ord 𝐴)
10 n0i 4333 . . . . . 6 (∅ ∈ (𝑅1𝐴) → ¬ (𝑅1𝐴) = ∅)
112, 10syl 17 . . . . 5 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → ¬ (𝑅1𝐴) = ∅)
12 fveq2 6890 . . . . . 6 (𝐴 = ∅ → (𝑅1𝐴) = (𝑅1‘∅))
13 r10 9801 . . . . . 6 (𝑅1‘∅) = ∅
1412, 13eqtrdi 2782 . . . . 5 (𝐴 = ∅ → (𝑅1𝐴) = ∅)
1511, 14nsyl 140 . . . 4 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → ¬ 𝐴 = ∅)
16 onsuc 7809 . . . . . . . 8 (𝐴 ∈ On → suc 𝐴 ∈ On)
177, 16syl 17 . . . . . . 7 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → suc 𝐴 ∈ On)
18 sucidg 6446 . . . . . . . 8 (𝐴 ∈ On → 𝐴 ∈ suc 𝐴)
197, 18syl 17 . . . . . . 7 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → 𝐴 ∈ suc 𝐴)
20 r1ord 9813 . . . . . . 7 (suc 𝐴 ∈ On → (𝐴 ∈ suc 𝐴 → (𝑅1𝐴) ∈ (𝑅1‘suc 𝐴)))
2117, 19, 20sylc 65 . . . . . 6 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → (𝑅1𝐴) ∈ (𝑅1‘suc 𝐴))
22 r1elwf 9829 . . . . . 6 ((𝑅1𝐴) ∈ (𝑅1‘suc 𝐴) → (𝑅1𝐴) ∈ (𝑅1 “ On))
23 wfelirr 9858 . . . . . 6 ((𝑅1𝐴) ∈ (𝑅1 “ On) → ¬ (𝑅1𝐴) ∈ (𝑅1𝐴))
2421, 22, 233syl 18 . . . . 5 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → ¬ (𝑅1𝐴) ∈ (𝑅1𝐴))
25 simprr 771 . . . . . . . . 9 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → 𝐴 = suc 𝑥)
2625fveq2d 6894 . . . . . . . 8 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → (𝑅1𝐴) = (𝑅1‘suc 𝑥))
27 r1suc 9803 . . . . . . . . 9 (𝑥 ∈ On → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1𝑥))
2827ad2antrl 726 . . . . . . . 8 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1𝑥))
2926, 28eqtrd 2766 . . . . . . 7 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → (𝑅1𝐴) = 𝒫 (𝑅1𝑥))
30 simplr 767 . . . . . . . 8 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → (𝑅1𝐴) ∈ WUni)
317adantr 479 . . . . . . . . 9 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → 𝐴 ∈ On)
32 sucidg 6446 . . . . . . . . . . 11 (𝑥 ∈ On → 𝑥 ∈ suc 𝑥)
3332ad2antrl 726 . . . . . . . . . 10 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → 𝑥 ∈ suc 𝑥)
3433, 25eleqtrrd 2829 . . . . . . . . 9 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → 𝑥𝐴)
35 r1ord 9813 . . . . . . . . 9 (𝐴 ∈ On → (𝑥𝐴 → (𝑅1𝑥) ∈ (𝑅1𝐴)))
3631, 34, 35sylc 65 . . . . . . . 8 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → (𝑅1𝑥) ∈ (𝑅1𝐴))
3730, 36wunpw 10738 . . . . . . 7 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → 𝒫 (𝑅1𝑥) ∈ (𝑅1𝐴))
3829, 37eqeltrd 2826 . . . . . 6 (((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) ∧ (𝑥 ∈ On ∧ 𝐴 = suc 𝑥)) → (𝑅1𝐴) ∈ (𝑅1𝐴))
3938rexlimdvaa 3146 . . . . 5 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝑅1𝐴) ∈ (𝑅1𝐴)))
4024, 39mtod 197 . . . 4 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)
41 ioran 981 . . . 4 (¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
4215, 40, 41sylanbrc 581 . . 3 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
43 dflim3 7846 . . 3 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
449, 42, 43sylanbrc 581 . 2 ((𝐴𝑉 ∧ (𝑅1𝐴) ∈ WUni) → Lim 𝐴)
45 r1limwun 10767 . 2 ((𝐴𝑉 ∧ Lim 𝐴) → (𝑅1𝐴) ∈ WUni)
4644, 45impbida 799 1 (𝐴𝑉 → ((𝑅1𝐴) ∈ WUni ↔ Lim 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 394  wo 845   = wceq 1534  wcel 2099  wrex 3060  c0 4322  𝒫 cpw 4597   cuni 4905  dom cdm 5672  cima 5675  Ord word 6364  Oncon0 6365  Lim wlim 6366  suc csuc 6367  cfv 6543  𝑅1cr1 9795  WUnicwun 10731
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7735  ax-reg 9625  ax-inf2 9674
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3776  df-csb 3892  df-dif 3949  df-un 3951  df-in 3953  df-ss 3963  df-pss 3966  df-nul 4323  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4906  df-int 4947  df-iun 4995  df-br 5144  df-opab 5206  df-mpt 5227  df-tr 5261  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6302  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7416  df-om 7866  df-2nd 7993  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-r1 9797  df-rank 9798  df-wun 10733
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator