| 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 10683 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 9803 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (𝑅1‘(rank‘𝐴))) | |
| 2 | rankon 9739 | . . . . . 6 ⊢ (rank‘𝐴) ∈ On | |
| 3 | omelon 9587 | . . . . . 6 ⊢ ω ∈ On | |
| 4 | oacl 8488 | . . . . . 6 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → ((rank‘𝐴) +o ω) ∈ On) | |
| 5 | 2, 3, 4 | mp2an 700 | . . . . 5 ⊢ ((rank‘𝐴) +o ω) ∈ On |
| 6 | peano1 7854 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 7 | oaord1 8504 | . . . . . . 7 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω))) | |
| 8 | 2, 3, 7 | mp2an 700 | . . . . . 6 ⊢ (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)) |
| 9 | 6, 8 | mpbi 232 | . . . . 5 ⊢ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω) |
| 10 | r1ord2 9725 | . . . . 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 3976 | . . 3 ⊢ (𝑅1‘(rank‘𝐴)) ⊆ 𝑈 |
| 14 | 1, 13 | sstrdi 3939 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ 𝑈) |
| 15 | limom 7847 | . . . . . 6 ⊢ Lim ω | |
| 16 | 3, 15 | pm3.2i 473 | . . . . 5 ⊢ (ω ∈ On ∧ Lim ω) |
| 17 | oalimcl 8513 | . . . . 5 ⊢ (((rank‘𝐴) ∈ On ∧ (ω ∈ On ∧ Lim ω)) → Lim ((rank‘𝐴) +o ω)) | |
| 18 | 2, 16, 17 | mp2an 700 | . . . 4 ⊢ Lim ((rank‘𝐴) +o ω) |
| 19 | r1limwun 10680 | . . . 4 ⊢ ((((rank‘𝐴) +o ω) ∈ On ∧ Lim ((rank‘𝐴) +o ω)) → (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni) | |
| 20 | 5, 18, 19 | mp2an 700 | . . 3 ⊢ (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni |
| 21 | 12, 20 | eqeltri 2848 | . 2 ⊢ 𝑈 ∈ WUni |
| 22 | 14, 21 | jctil 526 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝑈 ∈ WUni ∧ 𝐴 ⊆ 𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ⊆ wss 3895 ∅c0 4276 Oncon0 6331 Lim wlim 6332 ‘cfv 6506 (class class class)co 7381 ωcom 7831 +o coa 8418 𝑅1cr1 9706 rankcrnk 9707 WUnicwun 10644 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-reg 9526 ax-inf2 9582 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-oadd 8425 df-r1 9708 df-rank 9709 df-wun 10646 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |