| 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 10749 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 9842 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (𝑅1‘(rank‘𝐴))) | |
| 2 | rankon 9778 | . . . . . 6 ⊢ (rank‘𝐴) ∈ On | |
| 3 | omelon 9626 | . . . . . 6 ⊢ ω ∈ On | |
| 4 | oacl 8523 | . . . . . 6 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → ((rank‘𝐴) +o ω) ∈ On) | |
| 5 | 2, 3, 4 | mp2an 705 | . . . . 5 ⊢ ((rank‘𝐴) +o ω) ∈ On |
| 6 | peano1 7886 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 7 | oaord1 8539 | . . . . . . 7 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω))) | |
| 8 | 2, 3, 7 | mp2an 705 | . . . . . 6 ⊢ (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)) |
| 9 | 6, 8 | mpbi 233 | . . . . 5 ⊢ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω) |
| 10 | r1ord2 9764 | . . . . 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 3980 | . . 3 ⊢ (𝑅1‘(rank‘𝐴)) ⊆ 𝑈 |
| 14 | 1, 13 | sstrdi 3943 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ 𝑈) |
| 15 | limom 7879 | . . . . . 6 ⊢ Lim ω | |
| 16 | 3, 15 | pm3.2i 476 | . . . . 5 ⊢ (ω ∈ On ∧ Lim ω) |
| 17 | oalimcl 8548 | . . . . 5 ⊢ (((rank‘𝐴) ∈ On ∧ (ω ∈ On ∧ Lim ω)) → Lim ((rank‘𝐴) +o ω)) | |
| 18 | 2, 16, 17 | mp2an 705 | . . . 4 ⊢ Lim ((rank‘𝐴) +o ω) |
| 19 | r1limwun 10746 | . . . 4 ⊢ ((((rank‘𝐴) +o ω) ∈ On ∧ Lim ((rank‘𝐴) +o ω)) → (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni) | |
| 20 | 5, 18, 19 | mp2an 705 | . . 3 ⊢ (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni |
| 21 | 12, 20 | eqeltri 2856 | . 2 ⊢ 𝑈 ∈ WUni |
| 22 | 14, 21 | jctil 529 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝑈 ∈ WUni ∧ 𝐴 ⊆ 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ∅c0 4279 Oncon0 6357 Lim wlim 6358 ‘cfv 6533 (class class class)co 7414 ωcom 7863 +o coa 8453 𝑅1cr1 9745 rankcrnk 9746 WUnicwun 10710 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-reg 9565 ax-inf2 9621 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-oadd 8460 df-r1 9747 df-rank 9748 df-wun 10712 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |