| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r1fin | Structured version Visualization version GIF version | ||
| Description: The first ω stages of the cumulative hierarchy of sets are all finite. (Contributed by Mario Carneiro, 15-May-2013.) |
| Ref | Expression |
|---|---|
| r1fin | ⊢ (𝐴 ∈ ω → (𝑅1‘𝐴) ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6886 | . . 3 ⊢ (𝑛 = ∅ → (𝑅1‘𝑛) = (𝑅1‘∅)) | |
| 2 | 1 | eleq1d 2845 | . 2 ⊢ (𝑛 = ∅ → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘∅) ∈ Fin)) |
| 3 | fveq2 6886 | . . 3 ⊢ (𝑛 = 𝑚 → (𝑅1‘𝑛) = (𝑅1‘𝑚)) | |
| 4 | 3 | eleq1d 2845 | . 2 ⊢ (𝑛 = 𝑚 → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘𝑚) ∈ Fin)) |
| 5 | fveq2 6886 | . . 3 ⊢ (𝑛 = suc 𝑚 → (𝑅1‘𝑛) = (𝑅1‘suc 𝑚)) | |
| 6 | 5 | eleq1d 2845 | . 2 ⊢ (𝑛 = suc 𝑚 → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘suc 𝑚) ∈ Fin)) |
| 7 | fveq2 6886 | . . 3 ⊢ (𝑛 = 𝐴 → (𝑅1‘𝑛) = (𝑅1‘𝐴)) | |
| 8 | 7 | eleq1d 2845 | . 2 ⊢ (𝑛 = 𝐴 → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘𝐴) ∈ Fin)) |
| 9 | r10 9779 | . . 3 ⊢ (𝑅1‘∅) = ∅ | |
| 10 | 0fi 9074 | . . 3 ⊢ ∅ ∈ Fin | |
| 11 | 9, 10 | eqeltri 2856 | . 2 ⊢ (𝑅1‘∅) ∈ Fin |
| 12 | pwfi 9314 | . . . 4 ⊢ ((𝑅1‘𝑚) ∈ Fin ↔ 𝒫 (𝑅1‘𝑚) ∈ Fin) | |
| 13 | r1dmlim 9776 | . . . . . . . 8 ⊢ Lim dom 𝑅1 | |
| 14 | limomss 7883 | . . . . . . . 8 ⊢ (Lim dom 𝑅1 → ω ⊆ dom 𝑅1) | |
| 15 | 13, 14 | ax-mp 5 | . . . . . . 7 ⊢ ω ⊆ dom 𝑅1 |
| 16 | 15 | sseli 3904 | . . . . . 6 ⊢ (𝑚 ∈ ω → 𝑚 ∈ dom 𝑅1) |
| 17 | r1sucg 9780 | . . . . . 6 ⊢ (𝑚 ∈ dom 𝑅1 → (𝑅1‘suc 𝑚) = 𝒫 (𝑅1‘𝑚)) | |
| 18 | 16, 17 | syl 18 | . . . . 5 ⊢ (𝑚 ∈ ω → (𝑅1‘suc 𝑚) = 𝒫 (𝑅1‘𝑚)) |
| 19 | 18 | eleq1d 2845 | . . . 4 ⊢ (𝑚 ∈ ω → ((𝑅1‘suc 𝑚) ∈ Fin ↔ 𝒫 (𝑅1‘𝑚) ∈ Fin)) |
| 20 | 12, 19 | bitr4id 293 | . . 3 ⊢ (𝑚 ∈ ω → ((𝑅1‘𝑚) ∈ Fin ↔ (𝑅1‘suc 𝑚) ∈ Fin)) |
| 21 | 20 | biimpd 232 | . 2 ⊢ (𝑚 ∈ ω → ((𝑅1‘𝑚) ∈ Fin → (𝑅1‘suc 𝑚) ∈ Fin)) |
| 22 | 2, 4, 6, 8, 11, 21 | finds 7909 | 1 ⊢ (𝐴 ∈ ω → (𝑅1‘𝐴) ∈ Fin) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ∅c0 4278 𝒫 cpw 4556 dom cdm 5650 Lim wlim 6363 suc csuc 6364 ‘cfv 6539 ωcom 7878 Fincfn 8977 𝑅1cr1 9770 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-om 7879 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-en 8978 df-dom 8979 df-fin 8981 df-r1 9772 |
| This theorem is used by: hffi 9913 ackbij2lem2 10321 ackbij2 10324 kardnnfi 35894 |
| Copyright terms: Public domain | W3C validator |