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

Theorem wunex3 10428
Description: Construct a weak universe from a given set. This version of wunex 10426 has a simpler proof, but requires the axiom of regularity. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypothesis
Ref Expression
wunex3.u 𝑈 = (𝑅1‘((rank‘𝐴) +o ω))
Assertion
Ref Expression
wunex3 (𝐴𝑉 → (𝑈 ∈ WUni ∧ 𝐴𝑈))

Proof of Theorem wunex3
StepHypRef Expression
1 r1rankid 9548 . . 3 (𝐴𝑉𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
2 rankon 9484 . . . . . 6 (rank‘𝐴) ∈ On
3 omelon 9334 . . . . . 6 ω ∈ On
4 oacl 8327 . . . . . 6 (((rank‘𝐴) ∈ On ∧ ω ∈ On) → ((rank‘𝐴) +o ω) ∈ On)
52, 3, 4mp2an 688 . . . . 5 ((rank‘𝐴) +o ω) ∈ On
6 peano1 7710 . . . . . 6 ∅ ∈ ω
7 oaord1 8344 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ ω ∈ On) → (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)))
82, 3, 7mp2an 688 . . . . . 6 (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω))
96, 8mpbi 229 . . . . 5 (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)
10 r1ord2 9470 . . . . 5 (((rank‘𝐴) +o ω) ∈ On → ((rank‘𝐴) ∈ ((rank‘𝐴) +o ω) → (𝑅1‘(rank‘𝐴)) ⊆ (𝑅1‘((rank‘𝐴) +o ω))))
115, 9, 10mp2 9 . . . 4 (𝑅1‘(rank‘𝐴)) ⊆ (𝑅1‘((rank‘𝐴) +o ω))
12 wunex3.u . . . 4 𝑈 = (𝑅1‘((rank‘𝐴) +o ω))
1311, 12sseqtrri 3954 . . 3 (𝑅1‘(rank‘𝐴)) ⊆ 𝑈
141, 13sstrdi 3929 . 2 (𝐴𝑉𝐴𝑈)
15 limom 7703 . . . . . 6 Lim ω
163, 15pm3.2i 470 . . . . 5 (ω ∈ On ∧ Lim ω)
17 oalimcl 8353 . . . . 5 (((rank‘𝐴) ∈ On ∧ (ω ∈ On ∧ Lim ω)) → Lim ((rank‘𝐴) +o ω))
182, 16, 17mp2an 688 . . . 4 Lim ((rank‘𝐴) +o ω)
19 r1limwun 10423 . . . 4 ((((rank‘𝐴) +o ω) ∈ On ∧ Lim ((rank‘𝐴) +o ω)) → (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni)
205, 18, 19mp2an 688 . . 3 (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni
2112, 20eqeltri 2835 . 2 𝑈 ∈ WUni
2214, 21jctil 519 1 (𝐴𝑉 → (𝑈 ∈ WUni ∧ 𝐴𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wss 3883  c0 4253  Oncon0 6251  Lim wlim 6252  cfv 6418  (class class class)co 7255  ωcom 7687   +o coa 8264  𝑅1cr1 9451  rankcrnk 9452  WUnicwun 10387
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-reg 9281  ax-inf2 9329
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-oadd 8271  df-r1 9453  df-rank 9454  df-wun 10389
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator