| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frecuzrdg0 | GIF version | ||
| Description: Initial value of a recursive definition generator on upper integers. See comment in frec2uz0d 10705 for the description of 𝐺 as the mapping from ω to (ℤ≥‘𝐶). (Contributed by Jim Kingdon, 27-May-2020.) |
| Ref | Expression |
|---|---|
| frec2uz.1 | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| frec2uz.2 | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) |
| frecuzrdgrrn.a | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
| frecuzrdgrrn.f | ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆) |
| frecuzrdgrrn.2 | ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) |
| frecuzrdgtcl.3 | ⊢ (𝜑 → 𝑇 = ran 𝑅) |
| Ref | Expression |
|---|---|
| frecuzrdg0 | ⊢ (𝜑 → (𝑇‘𝐶) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frec2uz.1 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
| 2 | frec2uz.2 | . . . 4 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) | |
| 3 | frecuzrdgrrn.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
| 4 | frecuzrdgrrn.f | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆) | |
| 5 | frecuzrdgrrn.2 | . . . 4 ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) | |
| 6 | frecuzrdgtcl.3 | . . . 4 ⊢ (𝜑 → 𝑇 = ran 𝑅) | |
| 7 | 1, 2, 3, 4, 5, 6 | frecuzrdgtcl 10718 | . . 3 ⊢ (𝜑 → 𝑇:(ℤ≥‘𝐶)⟶𝑆) |
| 8 | ffun 5492 | . . 3 ⊢ (𝑇:(ℤ≥‘𝐶)⟶𝑆 → Fun 𝑇) | |
| 9 | 7, 8 | syl 14 | . 2 ⊢ (𝜑 → Fun 𝑇) |
| 10 | 5 | fveq1i 5649 | . . . . 5 ⊢ (𝑅‘∅) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉)‘∅) |
| 11 | opexg 4326 | . . . . . . 7 ⊢ ((𝐶 ∈ ℤ ∧ 𝐴 ∈ 𝑆) → 〈𝐶, 𝐴〉 ∈ V) | |
| 12 | 1, 3, 11 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ V) |
| 13 | frec0g 6606 | . . . . . 6 ⊢ (〈𝐶, 𝐴〉 ∈ V → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉)‘∅) = 〈𝐶, 𝐴〉) | |
| 14 | 12, 13 | syl 14 | . . . . 5 ⊢ (𝜑 → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉)‘∅) = 〈𝐶, 𝐴〉) |
| 15 | 10, 14 | eqtrid 2276 | . . . 4 ⊢ (𝜑 → (𝑅‘∅) = 〈𝐶, 𝐴〉) |
| 16 | 1, 2, 3, 4, 5 | frecuzrdgrcl 10716 | . . . . . 6 ⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆)) |
| 17 | ffn 5489 | . . . . . 6 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → 𝑅 Fn ω) | |
| 18 | 16, 17 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑅 Fn ω) |
| 19 | peano1 4698 | . . . . 5 ⊢ ∅ ∈ ω | |
| 20 | fnfvelrn 5787 | . . . . 5 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅) | |
| 21 | 18, 19, 20 | sylancl 413 | . . . 4 ⊢ (𝜑 → (𝑅‘∅) ∈ ran 𝑅) |
| 22 | 15, 21 | eqeltrrd 2309 | . . 3 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ ran 𝑅) |
| 23 | 22, 6 | eleqtrrd 2311 | . 2 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ 𝑇) |
| 24 | funopfv 5692 | . 2 ⊢ (Fun 𝑇 → (〈𝐶, 𝐴〉 ∈ 𝑇 → (𝑇‘𝐶) = 𝐴)) | |
| 25 | 9, 23, 24 | sylc 62 | 1 ⊢ (𝜑 → (𝑇‘𝐶) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 Vcvv 2803 ∅c0 3496 〈cop 3676 ↦ cmpt 4155 ωcom 4694 × cxp 4729 ran crn 4732 Fun wfun 5327 Fn wfn 5328 ⟶wf 5329 ‘cfv 5333 (class class class)co 6028 ∈ cmpo 6030 freccfrec 6599 1c1 8076 + caddc 8078 ℤcz 9522 ℤ≥cuz 9798 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-inn 9187 df-n0 9446 df-z 9523 df-uz 9799 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |