| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > om2uzrani | Structured version Visualization version GIF version | ||
| Description: Range of 𝐺 (see om2uz0i 14001). (Contributed by NM, 3-Oct-2004.) (Revised by Mario Carneiro, 13-Sep-2013.) |
| Ref | Expression |
|---|---|
| om2uz.1 | ⊢ 𝐶 ∈ ℤ |
| om2uz.2 | ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) |
| Ref | Expression |
|---|---|
| om2uzrani | ⊢ ran 𝐺 = (ℤ≥‘𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frfnom 8428 | . . . . . 6 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω | |
| 2 | om2uz.2 | . . . . . . 7 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
| 3 | 2 | fneq1i 6636 | . . . . . 6 ⊢ (𝐺 Fn ω ↔ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω) |
| 4 | 1, 3 | mpbir 234 | . . . . 5 ⊢ 𝐺 Fn ω |
| 5 | fvelrnb 6945 | . . . . 5 ⊢ (𝐺 Fn ω → (𝑦 ∈ ran 𝐺 ↔ ∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦)) | |
| 6 | 4, 5 | ax-mp 5 | . . . 4 ⊢ (𝑦 ∈ ran 𝐺 ↔ ∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦) |
| 7 | om2uz.1 | . . . . . . 7 ⊢ 𝐶 ∈ ℤ | |
| 8 | 7, 2 | om2uzuzi 14003 | . . . . . 6 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ (ℤ≥‘𝐶)) |
| 9 | eleq1 2853 | . . . . . 6 ⊢ ((𝐺‘𝑧) = 𝑦 → ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) ↔ 𝑦 ∈ (ℤ≥‘𝐶))) | |
| 10 | 8, 9 | syl5ibcom 248 | . . . . 5 ⊢ (𝑧 ∈ ω → ((𝐺‘𝑧) = 𝑦 → 𝑦 ∈ (ℤ≥‘𝐶))) |
| 11 | 10 | rexlimiv 3161 | . . . 4 ⊢ (∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦 → 𝑦 ∈ (ℤ≥‘𝐶)) |
| 12 | 6, 11 | sylbi 220 | . . 3 ⊢ (𝑦 ∈ ran 𝐺 → 𝑦 ∈ (ℤ≥‘𝐶)) |
| 13 | eleq1 2853 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝑧 ∈ ran 𝐺 ↔ 𝐶 ∈ ran 𝐺)) | |
| 14 | eleq1 2853 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ ran 𝐺 ↔ 𝑦 ∈ ran 𝐺)) | |
| 15 | eleq1 2853 | . . . 4 ⊢ (𝑧 = (𝑦 + 1) → (𝑧 ∈ ran 𝐺 ↔ (𝑦 + 1) ∈ ran 𝐺)) | |
| 16 | 7, 2 | om2uz0i 14001 | . . . . 5 ⊢ (𝐺‘∅) = 𝐶 |
| 17 | peano1 7891 | . . . . . 6 ⊢ ∅ ∈ ω | |
| 18 | fnfvelrn 7079 | . . . . . 6 ⊢ ((𝐺 Fn ω ∧ ∅ ∈ ω) → (𝐺‘∅) ∈ ran 𝐺) | |
| 19 | 4, 17, 18 | mp2an 705 | . . . . 5 ⊢ (𝐺‘∅) ∈ ran 𝐺 |
| 20 | 16, 19 | eqeltrri 2862 | . . . 4 ⊢ 𝐶 ∈ ran 𝐺 |
| 21 | 7, 2 | om2uzsuci 14002 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → (𝐺‘suc 𝑧) = ((𝐺‘𝑧) + 1)) |
| 22 | oveq1 7426 | . . . . . . . . 9 ⊢ ((𝐺‘𝑧) = 𝑦 → ((𝐺‘𝑧) + 1) = (𝑦 + 1)) | |
| 23 | 21, 22 | sylan9eq 2820 | . . . . . . . 8 ⊢ ((𝑧 ∈ ω ∧ (𝐺‘𝑧) = 𝑦) → (𝐺‘suc 𝑧) = (𝑦 + 1)) |
| 24 | peano2 7892 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ω → suc 𝑧 ∈ ω) | |
| 25 | fnfvelrn 7079 | . . . . . . . . . 10 ⊢ ((𝐺 Fn ω ∧ suc 𝑧 ∈ ω) → (𝐺‘suc 𝑧) ∈ ran 𝐺) | |
| 26 | 4, 24, 25 | sylancr 599 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → (𝐺‘suc 𝑧) ∈ ran 𝐺) |
| 27 | 26 | adantr 486 | . . . . . . . 8 ⊢ ((𝑧 ∈ ω ∧ (𝐺‘𝑧) = 𝑦) → (𝐺‘suc 𝑧) ∈ ran 𝐺) |
| 28 | 23, 27 | eqeltrrd 2866 | . . . . . . 7 ⊢ ((𝑧 ∈ ω ∧ (𝐺‘𝑧) = 𝑦) → (𝑦 + 1) ∈ ran 𝐺) |
| 29 | 28 | rexlimiva 3160 | . . . . . 6 ⊢ (∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦 → (𝑦 + 1) ∈ ran 𝐺) |
| 30 | 6, 29 | sylbi 220 | . . . . 5 ⊢ (𝑦 ∈ ran 𝐺 → (𝑦 + 1) ∈ ran 𝐺) |
| 31 | 30 | a1i 11 | . . . 4 ⊢ (𝑦 ∈ (ℤ≥‘𝐶) → (𝑦 ∈ ran 𝐺 → (𝑦 + 1) ∈ ran 𝐺)) |
| 32 | 13, 14, 15, 14, 20, 31 | uzind4i 12950 | . . 3 ⊢ (𝑦 ∈ (ℤ≥‘𝐶) → 𝑦 ∈ ran 𝐺) |
| 33 | 12, 32 | impbii 212 | . 2 ⊢ (𝑦 ∈ ran 𝐺 ↔ 𝑦 ∈ (ℤ≥‘𝐶)) |
| 34 | 33 | eqriv 2762 | 1 ⊢ ran 𝐺 = (ℤ≥‘𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 Vcvv 3457 ∅c0 4286 ↦ cmpt 5194 ran crn 5664 ↾ cres 5665 suc csuc 6366 Fn wfn 6535 ‘cfv 6540 (class class class)co 7419 ωcom 7868 reccrdg 8402 1c1 11116 + caddc 11118 ℤcz 12606 ℤ≥cuz 12878 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-n0 12520 df-z 12607 df-uz 12879 |
| This theorem is used by: om2uzf1oi 14007 |
| Copyright terms: Public domain | W3C validator |