| 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 14099. (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 14101 | . . 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 5432 | . . . . . 6 ⊢ 〈𝐶, 𝐴〉 ∈ V | |
| 11 | fr0g 8444 | . . . . . 6 ⊢ (〈𝐶, 𝐴〉 ∈ V → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) = 〈𝐶, 𝐴〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . . 5 ⊢ ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) ↾ ω)‘∅) = 〈𝐶, 𝐴〉 |
| 13 | 9, 12 | eqtri 2784 | . . . 4 ⊢ (𝑅‘∅) = 〈𝐶, 𝐴〉 |
| 14 | frfnom 8443 | . . . . . 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 7900 | . . . . 5 ⊢ ∅ ∈ ω | |
| 18 | fnfvelrn 7080 | . . . . 5 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅) | |
| 19 | 16, 17, 18 | mp2an 705 | . . . 4 ⊢ (𝑅‘∅) ∈ ran 𝑅 |
| 20 | 13, 19 | eqeltrri 2858 | . . 3 ⊢ 〈𝐶, 𝐴〉 ∈ ran 𝑅 |
| 21 | 20, 5 | eleqtrri 2860 | . 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 2145 Vcvv 3451 ∅c0 4279 〈cop 4590 ↦ cmpt 5186 ran crn 5652 ↾ cres 5653 Fun wfun 6532 Fn wfn 6533 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 ωcom 7877 reccrdg 8417 1c1 11201 + caddc 11203 ℤcz 12693 ℤ≥cuz 12965 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-n0 12607 df-z 12694 df-uz 12966 |
| This theorem is used by: seq1 14157 |
| Copyright terms: Public domain | W3C validator |