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 13309). (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 8064 | . . . . . 6 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω | |
2 | om2uz.2 | . . . . . . 7 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
3 | 2 | fneq1i 6445 | . . . . . 6 ⊢ (𝐺 Fn ω ↔ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) Fn ω) |
4 | 1, 3 | mpbir 233 | . . . . 5 ⊢ 𝐺 Fn ω |
5 | fvelrnb 6721 | . . . . 5 ⊢ (𝐺 Fn ω → (𝑦 ∈ ran 𝐺 ↔ ∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦)) | |
6 | 4, 5 | ax-mp 5 | . . . 4 ⊢ (𝑦 ∈ ran 𝐺 ↔ ∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦) |
7 | om2uz.1 | . . . . . . 7 ⊢ 𝐶 ∈ ℤ | |
8 | 7, 2 | om2uzuzi 13311 | . . . . . 6 ⊢ (𝑧 ∈ ω → (𝐺‘𝑧) ∈ (ℤ≥‘𝐶)) |
9 | eleq1 2900 | . . . . . 6 ⊢ ((𝐺‘𝑧) = 𝑦 → ((𝐺‘𝑧) ∈ (ℤ≥‘𝐶) ↔ 𝑦 ∈ (ℤ≥‘𝐶))) | |
10 | 8, 9 | syl5ibcom 247 | . . . . 5 ⊢ (𝑧 ∈ ω → ((𝐺‘𝑧) = 𝑦 → 𝑦 ∈ (ℤ≥‘𝐶))) |
11 | 10 | rexlimiv 3280 | . . . 4 ⊢ (∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦 → 𝑦 ∈ (ℤ≥‘𝐶)) |
12 | 6, 11 | sylbi 219 | . . 3 ⊢ (𝑦 ∈ ran 𝐺 → 𝑦 ∈ (ℤ≥‘𝐶)) |
13 | eleq1 2900 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝑧 ∈ ran 𝐺 ↔ 𝐶 ∈ ran 𝐺)) | |
14 | eleq1 2900 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ ran 𝐺 ↔ 𝑦 ∈ ran 𝐺)) | |
15 | eleq1 2900 | . . . 4 ⊢ (𝑧 = (𝑦 + 1) → (𝑧 ∈ ran 𝐺 ↔ (𝑦 + 1) ∈ ran 𝐺)) | |
16 | 7, 2 | om2uz0i 13309 | . . . . 5 ⊢ (𝐺‘∅) = 𝐶 |
17 | peano1 7595 | . . . . . 6 ⊢ ∅ ∈ ω | |
18 | fnfvelrn 6843 | . . . . . 6 ⊢ ((𝐺 Fn ω ∧ ∅ ∈ ω) → (𝐺‘∅) ∈ ran 𝐺) | |
19 | 4, 17, 18 | mp2an 690 | . . . . 5 ⊢ (𝐺‘∅) ∈ ran 𝐺 |
20 | 16, 19 | eqeltrri 2910 | . . . 4 ⊢ 𝐶 ∈ ran 𝐺 |
21 | 7, 2 | om2uzsuci 13310 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → (𝐺‘suc 𝑧) = ((𝐺‘𝑧) + 1)) |
22 | oveq1 7157 | . . . . . . . . 9 ⊢ ((𝐺‘𝑧) = 𝑦 → ((𝐺‘𝑧) + 1) = (𝑦 + 1)) | |
23 | 21, 22 | sylan9eq 2876 | . . . . . . . 8 ⊢ ((𝑧 ∈ ω ∧ (𝐺‘𝑧) = 𝑦) → (𝐺‘suc 𝑧) = (𝑦 + 1)) |
24 | peano2 7596 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ω → suc 𝑧 ∈ ω) | |
25 | fnfvelrn 6843 | . . . . . . . . . 10 ⊢ ((𝐺 Fn ω ∧ suc 𝑧 ∈ ω) → (𝐺‘suc 𝑧) ∈ ran 𝐺) | |
26 | 4, 24, 25 | sylancr 589 | . . . . . . . . 9 ⊢ (𝑧 ∈ ω → (𝐺‘suc 𝑧) ∈ ran 𝐺) |
27 | 26 | adantr 483 | . . . . . . . 8 ⊢ ((𝑧 ∈ ω ∧ (𝐺‘𝑧) = 𝑦) → (𝐺‘suc 𝑧) ∈ ran 𝐺) |
28 | 23, 27 | eqeltrrd 2914 | . . . . . . 7 ⊢ ((𝑧 ∈ ω ∧ (𝐺‘𝑧) = 𝑦) → (𝑦 + 1) ∈ ran 𝐺) |
29 | 28 | rexlimiva 3281 | . . . . . 6 ⊢ (∃𝑧 ∈ ω (𝐺‘𝑧) = 𝑦 → (𝑦 + 1) ∈ ran 𝐺) |
30 | 6, 29 | sylbi 219 | . . . . 5 ⊢ (𝑦 ∈ ran 𝐺 → (𝑦 + 1) ∈ ran 𝐺) |
31 | 30 | a1i 11 | . . . 4 ⊢ (𝑦 ∈ (ℤ≥‘𝐶) → (𝑦 ∈ ran 𝐺 → (𝑦 + 1) ∈ ran 𝐺)) |
32 | 13, 14, 15, 14, 20, 31 | uzind4i 12304 | . . 3 ⊢ (𝑦 ∈ (ℤ≥‘𝐶) → 𝑦 ∈ ran 𝐺) |
33 | 12, 32 | impbii 211 | . 2 ⊢ (𝑦 ∈ ran 𝐺 ↔ 𝑦 ∈ (ℤ≥‘𝐶)) |
34 | 33 | eqriv 2818 | 1 ⊢ ran 𝐺 = (ℤ≥‘𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∃wrex 3139 Vcvv 3495 ∅c0 4291 ↦ cmpt 5139 ran crn 5551 ↾ cres 5552 suc csuc 6188 Fn wfn 6345 ‘cfv 6350 (class class class)co 7150 ωcom 7574 reccrdg 8039 1c1 10532 + caddc 10534 ℤcz 11975 ℤ≥cuz 12237 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 |
This theorem is referenced by: om2uzf1oi 13315 |
Copyright terms: Public domain | W3C validator |