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

Theorem wunex3 10743
Description: Construct a weak universe from a given set. This version of wunex 10741 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 9838 . . 3 (𝐴𝑉𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
2 rankon 9774 . . . . . 6 (rank‘𝐴) ∈ On
3 omelon 9622 . . . . . 6 ω ∈ On
4 oacl 8526 . . . . . 6 (((rank‘𝐴) ∈ On ∧ ω ∈ On) → ((rank‘𝐴) +o ω) ∈ On)
52, 3, 4mp2an 705 . . . . 5 ((rank‘𝐴) +o ω) ∈ On
6 peano1 7891 . . . . . 6 ∅ ∈ ω
7 oaord1 8542 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ ω ∈ On) → (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)))
82, 3, 7mp2an 705 . . . . . 6 (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω))
96, 8mpbi 233 . . . . 5 (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)
10 r1ord2 9760 . . . . 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 3987 . . 3 (𝑅1‘(rank‘𝐴)) ⊆ 𝑈
141, 13sstrdi 3950 . 2 (𝐴𝑉𝐴𝑈)
15 limom 7884 . . . . . 6 Lim ω
163, 15pm3.2i 476 . . . . 5 (ω ∈ On ∧ Lim ω)
17 oalimcl 8551 . . . . 5 (((rank‘𝐴) ∈ On ∧ (ω ∈ On ∧ Lim ω)) → Lim ((rank‘𝐴) +o ω))
182, 16, 17mp2an 705 . . . 4 Lim ((rank‘𝐴) +o ω)
19 r1limwun 10738 . . . 4 ((((rank‘𝐴) +o ω) ∈ On ∧ Lim ((rank‘𝐴) +o ω)) → (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni)
205, 18, 19mp2an 705 . . 3 (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni
2112, 20eqeltri 2861 . 2 𝑈 ∈ WUni
2214, 21jctil 529 1 (𝐴𝑉 → (𝑈 ∈ WUni ∧ 𝐴𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wss 3906  c0 4286  Oncon0 6364  Lim wlim 6365  cfv 6540  (class class class)co 7419  ωcom 7868   +o coa 8456  𝑅1cr1 9741  rankcrnk 9742  WUnicwun 10702
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-reg 9561  ax-inf2 9617
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-oadd 8463  df-r1 9743  df-rank 9744  df-wun 10704
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator