| 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 14012. (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 14014 | . . 3 ⊢ 𝑆 Fn (ℤ≥‘𝐶) |
| 7 | fnfun 6639 | . . 3 ⊢ (𝑆 Fn (ℤ≥‘𝐶) → Fun 𝑆) | |
| 8 | 6, 7 | ax-mp 5 | . 2 ⊢ Fun 𝑆 |
| 9 | 4 | fveq1i 6886 | . . . . 5 ⊢ (𝑅‘∅) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) |
| 10 | opex 5447 | . . . . . 6 ⊢ 〈𝐶, 𝐴〉 ∈ V | |
| 11 | fr0g 8429 | . . . . . 6 ⊢ (〈𝐶, 𝐴〉 ∈ V → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) = 〈𝐶, 𝐴〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . . 5 ⊢ ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) = 〈𝐶, 𝐴〉 |
| 13 | 9, 12 | eqtri 2788 | . . . 4 ⊢ (𝑅‘∅) = 〈𝐶, 𝐴〉 |
| 14 | frfnom 8428 | . . . . . 6 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω | |
| 15 | 4 | fneq1i 6636 | . . . . . 6 ⊢ (𝑅 Fn ω ↔ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω) Fn ω) |
| 16 | 14, 15 | mpbir 234 | . . . . 5 ⊢ 𝑅 Fn ω |
| 17 | peano1 7891 | . . . . 5 ⊢ ∅ ∈ ω | |
| 18 | fnfvelrn 7079 | . . . . 5 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅) | |
| 19 | 16, 17, 18 | mp2an 705 | . . . 4 ⊢ (𝑅‘∅) ∈ ran 𝑅 |
| 20 | 13, 19 | eqeltrri 2862 | . . 3 ⊢ 〈𝐶, 𝐴〉 ∈ ran 𝑅 |
| 21 | 20, 5 | eleqtrri 2864 | . 2 ⊢ 〈𝐶, 𝐴〉 ∈ 𝑆 |
| 22 | funopfv 6934 | . 2 ⊢ (Fun 𝑆 → (〈𝐶, 𝐴〉 ∈ 𝑆 → (𝑆‘𝐶) = 𝐴)) | |
| 23 | 8, 21, 22 | mp2 9 | 1 ⊢ (𝑆‘𝐶) = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 Vcvv 3457 ∅c0 4286 〈cop 4597 ↦ cmpt 5194 ran crn 5664 ↾ cres 5665 Fun wfun 6534 Fn wfn 6535 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 ωcom 7868 reccrdg 8402 1c1 11118 + caddc 11120 ℤcz 12608 ℤ≥cuz 12880 |
| 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 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| 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 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-n0 12522 df-z 12609 df-uz 12881 |
| This theorem is used by: seq1 14070 |
| Copyright terms: Public domain | W3C validator |