| 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 14014) 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 6879 | . . 3 ⊢ (𝑦 = ∅ → (𝐺‘𝑦) = (𝐺‘∅)) | |
| 2 | 1 | eleq1d 2845 | . 2 ⊢ (𝑦 = ∅ → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘∅) ∈ (ℤ≥‘𝐶))) |
| 3 | fveq2 6879 | . . 3 ⊢ (𝑦 = 𝑧 → (𝐺‘𝑦) = (𝐺‘𝑧)) | |
| 4 | 3 | eleq1d 2845 | . 2 ⊢ (𝑦 = 𝑧 → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘𝑧) ∈ (ℤ≥‘𝐶))) |
| 5 | fveq2 6879 | . . 3 ⊢ (𝑦 = suc 𝑧 → (𝐺‘𝑦) = (𝐺‘suc 𝑧)) | |
| 6 | 5 | eleq1d 2845 | . 2 ⊢ (𝑦 = suc 𝑧 → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘suc 𝑧) ∈ (ℤ≥‘𝐶))) |
| 7 | fveq2 6879 | . . 3 ⊢ (𝑦 = 𝐴 → (𝐺‘𝑦) = (𝐺‘𝐴)) | |
| 8 | 7 | eleq1d 2845 | . 2 ⊢ (𝑦 = 𝐴 → ((𝐺‘𝑦) ∈ (ℤ≥‘𝐶) ↔ (𝐺‘𝐴) ∈ (ℤ≥‘𝐶))) |
| 9 | om2uz.1 | . . . 4 ⊢ 𝐶 ∈ ℤ | |
| 10 | om2uz.2 | . . . 4 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
| 11 | 9, 10 | om2uz0i 14014 | . . 3 ⊢ (𝐺‘∅) = 𝐶 |
| 12 | uzid 12905 | . . . 4 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶)) | |
| 13 | 9, 12 | ax-mp 5 | . . 3 ⊢ 𝐶 ∈ (ℤ≥‘𝐶) |
| 14 | 11, 13 | eqeltri 2856 | . 2 ⊢ (𝐺‘∅) ∈ (ℤ≥‘𝐶) |
| 15 | peano2uz 12953 | . . 3 ⊢ ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) → ((𝐺‘𝑧) + 1) ∈ (ℤ≥‘𝐶)) | |
| 16 | 9, 10 | om2uzsuci 14015 | . . . 4 ⊢ (𝑧 ∈ ω → (𝐺‘suc 𝑧) = ((𝐺‘𝑧) + 1)) |
| 17 | 16 | eleq1d 2845 | . . 3 ⊢ (𝑧 ∈ ω → ((𝐺‘suc 𝑧) ∈ (ℤ≥‘𝐶) ↔ ((𝐺‘𝑧) + 1) ∈ (ℤ≥‘𝐶))) |
| 18 | 15, 17 | imbitrrid 249 | . 2 ⊢ (𝑧 ∈ ω → ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) → (𝐺‘suc 𝑧) ∈ (ℤ≥‘𝐶))) |
| 19 | 2, 4, 6, 8, 14, 18 | finds 7894 | 1 ⊢ (𝐴 ∈ ω → (𝐺‘𝐴) ∈ (ℤ≥‘𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∅c0 4279 ↦ cmpt 5186 ↾ cres 5657 suc csuc 6359 ‘cfv 6533 (class class class)co 7414 ωcom 7863 reccrdg 8399 1c1 11128 + caddc 11130 ℤcz 12618 ℤ≥cuz 12890 |
| 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-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| 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-nel 3062 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-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-riota 7371 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-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-n0 12532 df-z 12619 df-uz 12891 |
| This theorem is used by: om2uzlti 14017 om2uzlt2i 14018 om2uzrani 14019 om2uzf1oi 14020 uzrdgfni 14025 uzrdgxfr 14034 unbenlem 17003 |
| Copyright terms: Public domain | W3C validator |