| 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 6916 | . . 3 ⊢ (𝑛 = ∅ → (𝑅1‘𝑛) = (𝑅1‘∅)) | |
| 2 | 1 | eleq1d 2849 | . 2 ⊢ (𝑛 = ∅ → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘∅) ∈ Fin)) |
| 3 | fveq2 6916 | . . 3 ⊢ (𝑛 = 𝑚 → (𝑅1‘𝑛) = (𝑅1‘𝑚)) | |
| 4 | 3 | eleq1d 2849 | . 2 ⊢ (𝑛 = 𝑚 → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘𝑚) ∈ Fin)) |
| 5 | fveq2 6916 | . . 3 ⊢ (𝑛 = suc 𝑚 → (𝑅1‘𝑛) = (𝑅1‘suc 𝑚)) | |
| 6 | 5 | eleq1d 2849 | . 2 ⊢ (𝑛 = suc 𝑚 → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘suc 𝑚) ∈ Fin)) |
| 7 | fveq2 6916 | . . 3 ⊢ (𝑛 = 𝐴 → (𝑅1‘𝑛) = (𝑅1‘𝐴)) | |
| 8 | 7 | eleq1d 2849 | . 2 ⊢ (𝑛 = 𝐴 → ((𝑅1‘𝑛) ∈ Fin ↔ (𝑅1‘𝐴) ∈ Fin)) |
| 9 | r10 9812 | . . 3 ⊢ (𝑅1‘∅) = ∅ | |
| 10 | 0fi 9108 | . . 3 ⊢ ∅ ∈ Fin | |
| 11 | 9, 10 | eqeltri 2860 | . 2 ⊢ (𝑅1‘∅) ∈ Fin |
| 12 | pwfi 9348 | . . . 4 ⊢ ((𝑅1‘𝑚) ∈ Fin ↔ 𝒫 (𝑅1‘𝑚) ∈ Fin) | |
| 13 | r1dmlim 9809 | . . . . . . . 8 ⊢ Lim dom 𝑅1 | |
| 14 | limomss 7916 | . . . . . . . 8 ⊢ (Lim dom 𝑅1 → ω ⊆ dom 𝑅1) | |
| 15 | 13, 14 | ax-mp 5 | . . . . . . 7 ⊢ ω ⊆ dom 𝑅1 |
| 16 | 15 | sseli 3909 | . . . . . 6 ⊢ (𝑚 ∈ ω → 𝑚 ∈ dom 𝑅1) |
| 17 | r1sucg 9813 | . . . . . 6 ⊢ (𝑚 ∈ dom 𝑅1 → (𝑅1‘suc 𝑚) = 𝒫 (𝑅1‘𝑚)) | |
| 18 | 16, 17 | syl 18 | . . . . 5 ⊢ (𝑚 ∈ ω → (𝑅1‘suc 𝑚) = 𝒫 (𝑅1‘𝑚)) |
| 19 | 18 | eleq1d 2849 | . . . 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 7942 | 1 ⊢ (𝐴 ∈ ω → (𝑅1‘𝐴) ∈ Fin) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 𝒫 cpw 4560 dom cdm 5658 Lim wlim 6389 suc csuc 6390 ‘cfv 6566 ωcom 7911 Fincfn 9011 𝑅1cr1 9803 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-en 9012 df-dom 9013 df-fin 9015 df-r1 9805 |
| This theorem is used by: hffi 9946 ackbij2lem2 10356 ackbij2 10359 kardnnfi 35978 |
| Copyright terms: Public domain | W3C validator |