| 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 14139. (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 14141 | . . 3 ⊢ 𝑆 Fn (ℤ≥‘𝐶) |
| 7 | fnfun 6669 | . . 3 ⊢ (𝑆 Fn (ℤ≥‘𝐶) → Fun 𝑆) | |
| 8 | 6, 7 | ax-mp 5 | . 2 ⊢ Fun 𝑆 |
| 9 | 4 | fveq1i 6917 | . . . . 5 ⊢ (𝑅‘∅) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) |
| 10 | opex 5439 | . . . . . 6 ⊢ 〈𝐶, 𝐴〉 ∈ V | |
| 11 | fr0g 8482 | . . . . . 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 8481 | . . . . . 6 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω | |
| 15 | 4 | fneq1i 6666 | . . . . . 6 ⊢ (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω) |
| 16 | 14, 15 | mpbir 234 | . . . . 5 ⊢ 𝑅 Fn ω |
| 17 | peano1 7934 | . . . . 5 ⊢ ∅ ∈ ω | |
| 18 | fnfvelrn 7112 | . . . . 5 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅) | |
| 19 | 16, 17, 18 | mp2an 705 | . . . 4 ⊢ (𝑅‘∅) ∈ ran 𝑅 |
| 20 | 13, 19 | eqeltrri 2861 | . . 3 ⊢ 〈𝐶, 𝐴〉 ∈ ran 𝑅 |
| 21 | 20, 5 | eleqtrri 2863 | . 2 ⊢ 〈𝐶, 𝐴〉 ∈ 𝑆 |
| 22 | funopfv 6965 | . 2 ⊢ (Fun 𝑆 → (〈𝐶, 𝐴〉 ∈ 𝑆 → (𝑆‘𝐶) = 𝐴)) | |
| 23 | 8, 21, 22 | mp2 9 | 1 ⊢ (𝑆‘𝐶) = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∅c0 4281 〈cop 4840 ↦ cmpt 5192 ran crn 5659 ↾ cres 5660 Fun wfun 6560 Fn wfn 6561 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 ωcom 7911 reccrdg 8455 1c1 11240 + caddc 11242 ℤcz 12733 ℤ≥cuz 13005 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 |
| This theorem is used by: seq1 14197 |
| Copyright terms: Public domain | W3C validator |