| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > om2uzuzi | Structured version Visualization version GIF version | ||
| Description: The value 𝐺 (see om2uz0i 13962) at an ordinal natural number is in the upper integers. (Contributed by NM, 3-Oct-2004.) (Revised by Mario Carneiro, 13-Sep-2013.) |
| Ref | Expression |
|---|---|
| om2uz.1 | ⊢ 𝐶 ∈ ℤ |
| om2uz.2 | ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) |
| Ref | Expression |
|---|---|
| om2uzuzi | ⊢ (𝐴 ∈ ω → (𝐺‘𝐴) ∈ (ℤ≥‘𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6869 | . . 3 ⊢ (𝑦 = ∅ → (𝐺‘𝑦) = (𝐺‘∅)) | |
| 2 | 1 | eleq1d 2849 | . 2 ⊢ (𝑦 = ∅ → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘∅) ∈ (ℤ≥‘𝐶))) |
| 3 | fveq2 6869 | . . 3 ⊢ (𝑦 = 𝑧 → (𝐺‘𝑦) = (𝐺‘𝑧)) | |
| 4 | 3 | eleq1d 2849 | . 2 ⊢ (𝑦 = 𝑧 → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘𝑧) ∈ (ℤ≥‘𝐶))) |
| 5 | fveq2 6869 | . . 3 ⊢ (𝑦 = suc 𝑧 → (𝐺‘𝑦) = (𝐺‘suc 𝑧)) | |
| 6 | 5 | eleq1d 2849 | . 2 ⊢ (𝑦 = suc 𝑧 → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘suc 𝑧) ∈ (ℤ≥‘𝐶))) |
| 7 | fveq2 6869 | . . 3 ⊢ (𝑦 = 𝐴 → (𝐺‘𝑦) = (𝐺‘𝐴)) | |
| 8 | 7 | eleq1d 2849 | . 2 ⊢ (𝑦 = 𝐴 → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘𝐴) ∈ (ℤ≥‘𝐶))) |
| 9 | om2uz.1 | . . . 4 ⊢ 𝐶 ∈ ℤ | |
| 10 | om2uz.2 | . . . 4 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
| 11 | 9, 10 | om2uz0i 13962 | . . 3 ⊢ (𝐺‘∅) = 𝐶 |
| 12 | uzid 12856 | . . . 4 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶)) | |
| 13 | 9, 12 | ax-mp 5 | . . 3 ⊢ 𝐶 ∈ (ℤ≥‘𝐶) |
| 14 | 11, 13 | eqeltri 2860 | . 2 ⊢ (𝐺‘∅) ∈ (ℤ≥‘𝐶) |
| 15 | peano2uz 12904 | . . 3 ⊢ ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) → ((𝐺‘𝑧) + 1) ∈ (ℤ≥‘𝐶)) | |
| 16 | 9, 10 | om2uzsuci 13963 | . . . 4 ⊢ (𝑧 ∈ ω → (𝐺‘suc 𝑧) = ((𝐺‘𝑧) + 1)) |
| 17 | 16 | eleq1d 2849 | . . 3 ⊢ (𝑧 ∈ ω → ((𝐺‘suc 𝑧) ∈ (ℤ≥‘𝐶) ↔ ((𝐺‘𝑧) + 1) ∈ (ℤ≥‘𝐶))) |
| 18 | 15, 17 | imbitrrid 248 | . 2 ⊢ (𝑧 ∈ ω → ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) → (𝐺‘suc 𝑧) ∈ (ℤ≥‘𝐶))) |
| 19 | 2, 4, 6, 8, 14, 18 | finds 7879 | 1 ⊢ (𝐴 ∈ ω → (𝐺‘𝐴) ∈ (ℤ≥‘𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1562 ∈ wcel 2144 Vcvv 3456 ∅c0 4287 ↦ cmpt 5183 ↾ cres 5651 suc csuc 6350 ‘cfv 6523 (class class class)co 7398 ωcom 7848 reccrdg 8382 1c1 11076 + caddc 11078 ℤcz 12570 ℤ≥cuz 12841 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-nn 12213 df-n0 12484 df-z 12571 df-uz 12842 |
| This theorem is referenced by: om2uzlti 13965 om2uzlt2i 13966 om2uzrani 13967 om2uzf1oi 13968 uzrdgfni 13973 uzrdgxfr 13982 unbenlem 16946 |
| Copyright terms: Public domain | W3C validator |