| 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 10697 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 9817 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (𝑅1‘(rank‘𝐴))) | |
| 2 | rankon 9753 | . . . . . 6 ⊢ (rank‘𝐴) ∈ On | |
| 3 | omelon 9601 | . . . . . 6 ⊢ ω ∈ On | |
| 4 | oacl 8504 | . . . . . 6 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → ((rank‘𝐴) +o ω) ∈ On) | |
| 5 | 2, 3, 4 | mp2an 702 | . . . . 5 ⊢ ((rank‘𝐴) +o ω) ∈ On |
| 6 | peano1 7869 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 7 | oaord1 8520 | . . . . . . 7 ⊢ (((rank‘𝐴) ∈ On ∧ ω ∈ On) → (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω))) | |
| 8 | 2, 3, 7 | mp2an 702 | . . . . . 6 ⊢ (∅ ∈ ω ↔ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω)) |
| 9 | 6, 8 | mpbi 232 | . . . . 5 ⊢ (rank‘𝐴) ∈ ((rank‘𝐴) +o ω) |
| 10 | r1ord2 9739 | . . . . 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 3985 | . . 3 ⊢ (𝑅1‘(rank‘𝐴)) ⊆ 𝑈 |
| 14 | 1, 13 | sstrdi 3948 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ 𝑈) |
| 15 | limom 7862 | . . . . . 6 ⊢ Lim ω | |
| 16 | 3, 15 | pm3.2i 474 | . . . . 5 ⊢ (ω ∈ On ∧ Lim ω) |
| 17 | oalimcl 8529 | . . . . 5 ⊢ (((rank‘𝐴) ∈ On ∧ (ω ∈ On ∧ Lim ω)) → Lim ((rank‘𝐴) +o ω)) | |
| 18 | 2, 16, 17 | mp2an 702 | . . . 4 ⊢ Lim ((rank‘𝐴) +o ω) |
| 19 | r1limwun 10694 | . . . 4 ⊢ ((((rank‘𝐴) +o ω) ∈ On ∧ Lim ((rank‘𝐴) +o ω)) → (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni) | |
| 20 | 5, 18, 19 | mp2an 702 | . . 3 ⊢ (𝑅1‘((rank‘𝐴) +o ω)) ∈ WUni |
| 21 | 12, 20 | eqeltri 2858 | . 2 ⊢ 𝑈 ∈ WUni |
| 22 | 14, 21 | jctil 527 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝑈 ∈ WUni ∧ 𝐴 ⊆ 𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ⊆ wss 3904 ∅c0 4285 Oncon0 6346 Lim wlim 6347 ‘cfv 6521 (class class class)co 7396 ωcom 7846 +o coa 8434 𝑅1cr1 9720 rankcrnk 9721 WUnicwun 10658 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-reg 9540 ax-inf2 9596 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-oadd 8441 df-r1 9722 df-rank 9723 df-wun 10660 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |