| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wunex3 | Structured version Visualization version GIF version | ||
| Description: Construct a weak universe from a given set. This version of wunex 10699 has a simpler proof, but requires the axiom of regularity. (Contributed by Mario Carneiro, 2-Jan-2017.) |
| Ref | Expression |
|---|---|
| wunex3.u | ⊢ 𝑈 = (𝑅1‘((rank‘𝐴) +o ω)) |
| Ref | Expression |
|---|---|
| wunex3 | ⊢ (𝐴 ∈ 𝑉 → (𝑈 ∈ WUni ∧ 𝐴 ⊆ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r1rankid 9819 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (𝑅1‘(rank‘𝐴))) | |
| 2 | rankon 9755 | . . . . . 6 ⊢ (rank‘𝐴) ∈ On | |
| 3 | omelon 9606 | . . . . . 6 ⊢ ω ∈ On | |
| 4 | oacl 8502 | . . . . . 6 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → ((rank‘𝐴) +o ω) ∈ On) | |
| 5 | 2, 3, 4 | mp2an 692 | . . . . 5 ⊢ ((rank‘𝐴) +o ω) ∈ On |
| 6 | peano1 7868 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 7 | oaord1 8518 | . . . . . . 7 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω))) | |
| 8 | 2, 3, 7 | mp2an 692 | . . . . . 6 ⊢ (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)) |
| 9 | 6, 8 | mpbi 230 | . . . . 5 ⊢ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω) |
| 10 | r1ord2 9741 | . . . . 5 ⊢ (((rank‘𝐴) +o ω) ∈ On → ((rank‘𝐴) ∈ ((rank‘𝐴) +o ω) → (𝑅1‘(rank‘𝐴)) ⊆ (𝑅1‘((rank‘𝐴) +o ω)))) | |
| 11 | 5, 9, 10 | mp2 9 | . . . 4 ⊢ (𝑅1‘(rank‘𝐴)) ⊆ (𝑅1‘((rank‘𝐴) +o ω)) |
| 12 | wunex3.u | . . . 4 ⊢ 𝑈 = (𝑅1‘((rank‘𝐴) +o ω)) | |
| 13 | 11, 12 | sseqtrri 3999 | . . 3 ⊢ (𝑅1‘(rank‘𝐴)) ⊆ 𝑈 |
| 14 | 1, 13 | sstrdi 3962 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ 𝑈) |
| 15 | limom 7861 | . . . . . 6 ⊢ Lim ω | |
| 16 | 3, 15 | pm3.2i 470 | . . . . 5 ⊢ (ω ∈ On ∧ Lim ω) |
| 17 | oalimcl 8527 | . . . . 5 ⊢ (((rank‘𝐴) ∈ On ∧ (ω ∈ On ∧ Lim ω)) → Lim ((rank‘𝐴) +o ω)) | |
| 18 | 2, 16, 17 | mp2an 692 | . . . 4 ⊢ Lim ((rank‘𝐴) +o ω) |
| 19 | r1limwun 10696 | . . . 4 ⊢ ((((rank‘𝐴) +o ω) ∈ On ∧ Lim ((rank‘𝐴) +o ω)) → (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni) | |
| 20 | 5, 18, 19 | mp2an 692 | . . 3 ⊢ (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni |
| 21 | 12, 20 | eqeltri 2825 | . 2 ⊢ 𝑈 ∈ WUni |
| 22 | 14, 21 | jctil 519 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝑈 ∈ WUni ∧ 𝐴 ⊆ 𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ⊆ wss 3917 ∅c0 4299 Oncon0 6335 Lim wlim 6336 ‘cfv 6514 (class class class)co 7390 ωcom 7845 +o coa 8434 𝑅1cr1 9722 rankcrnk 9723 WUnicwun 10660 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-reg 9552 ax-inf2 9601 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-oadd 8441 df-r1 9724 df-rank 9725 df-wun 10662 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |