| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uzrdg0i | Structured version Visualization version GIF version | ||
| Description: Initial value of a recursive definition generator on upper integers. See comment in om2uzrdg 14109. (Contributed by Mario Carneiro, 26-Jun-2013.) (Revised by Mario Carneiro, 18-Nov-2014.) |
| Ref | Expression |
|---|---|
| om2uz.1 | ⊢ 𝐶 ∈ ℤ |
| om2uz.2 | ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) |
| uzrdg.1 | ⊢ 𝐴 ∈ V |
| uzrdg.2 | ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) |
| uzrdg.3 | ⊢ 𝑆 = ran 𝑅 |
| Ref | Expression |
|---|---|
| uzrdg0i | ⊢ (𝑆‘𝐶) = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | om2uz.1 | . . . 4 ⊢ 𝐶 ∈ ℤ | |
| 2 | om2uz.2 | . . . 4 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω) | |
| 3 | uzrdg.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 4 | uzrdg.2 | . . . 4 ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) | |
| 5 | uzrdg.3 | . . . 4 ⊢ 𝑆 = ran 𝑅 | |
| 6 | 1, 2, 3, 4, 5 | uzrdgfni 14111 | . . 3 ⊢ 𝑆 Fn (ℤ≥‘𝐶) |
| 7 | fnfun 6647 | . . 3 ⊢ (𝑆 Fn (ℤ≥‘𝐶) → Fun 𝑆) | |
| 8 | 6, 7 | ax-mp 5 | . 2 ⊢ Fun 𝑆 |
| 9 | 4 | fveq1i 6894 | . . . . 5 ⊢ (𝑅‘∅) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) |
| 10 | opex 5435 | . . . . . 6 ⊢ 〈𝐶, 𝐴〉 ∈ V | |
| 11 | fr0g 8455 | . . . . . 6 ⊢ (〈𝐶, 𝐴〉 ∈ V → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) = 〈𝐶, 𝐴〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . . 5 ⊢ ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) = 〈𝐶, 𝐴〉 |
| 13 | 9, 12 | eqtri 2786 | . . . 4 ⊢ (𝑅‘∅) = 〈𝐶, 𝐴〉 |
| 14 | frfnom 8454 | . . . . . 6 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω | |
| 15 | 4 | fneq1i 6644 | . . . . . 6 ⊢ (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω) |
| 16 | 14, 15 | mpbir 234 | . . . . 5 ⊢ 𝑅 Fn ω |
| 17 | peano1 7907 | . . . . 5 ⊢ ∅ ∈ ω | |
| 18 | fnfvelrn 7088 | . . . . 5 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅) | |
| 19 | 16, 17, 18 | mp2an 705 | . . . 4 ⊢ (𝑅‘∅) ∈ ran 𝑅 |
| 20 | 13, 19 | eqeltrri 2860 | . . 3 ⊢ 〈𝐶, 𝐴〉 ∈ ran 𝑅 |
| 21 | 20, 5 | eleqtrri 2862 | . 2 ⊢ 〈𝐶, 𝐴〉 ∈ 𝑆 |
| 22 | funopfv 6942 | . 2 ⊢ (Fun 𝑆 → (〈𝐶, 𝐴〉 ∈ 𝑆 → (𝑆‘𝐶) = 𝐴)) | |
| 23 | 8, 21, 22 | mp2 9 | 1 ⊢ (𝑆‘𝐶) = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2146 Vcvv 3453 ∅c0 4280 〈cop 4837 ↦ cmpt 5188 ran crn 5655 ↾ cres 5656 Fun wfun 6540 Fn wfn 6541 ‘cfv 6546 (class class class)co 7427 ∈ cmpo 7429 ωcom 7884 reccrdg 8428 1c1 11211 + caddc 11213 ℤcz 12703 ℤ≥cuz 12975 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-nn 12346 df-n0 12617 df-z 12704 df-uz 12976 |
| This theorem is used by: seq1 14167 |
| Copyright terms: Public domain | W3C validator |