| 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 10819 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 10832 | . . 3 ⊢ (𝜑 → 𝑇:(ℤ≥‘𝐶)⟶𝑆) |
| 8 | ffun 5534 | . . 3 ⊢ (𝑇:(ℤ≥‘𝐶)⟶𝑆 → Fun 𝑇) | |
| 9 | 7, 8 | syl 14 | . 2 ⊢ (𝜑 → Fun 𝑇) |
| 10 | 5 | fveq1i 5694 | . . . . 5 ⊢ (𝑅‘∅) = (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉)‘∅) |
| 11 | opexg 4366 | . . . . . . 7 ⊢ ((𝐶 ∈ ℤ ∧ 𝐴 ∈ 𝑆) → 〈𝐶, 𝐴〉 ∈ V) | |
| 12 | 1, 3, 11 | syl2anc 415 | . . . . . 6 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ V) |
| 13 | frec0g 6662 | . . . . . 6 ⊢ (〈𝐶, 𝐴〉 ∈ V → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉)‘∅) = 〈𝐶, 𝐴〉) | |
| 14 | 12, 13 | syl 14 | . . . . 5 ⊢ (𝜑 → (frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉)‘∅) = 〈𝐶, 𝐴〉) |
| 15 | 10, 14 | eqtrid 2283 | . . . 4 ⊢ (𝜑 → (𝑅‘∅) = 〈𝐶, 𝐴〉) |
| 16 | 1, 2, 3, 4, 5 | frecuzrdgrcl 10830 | . . . . . 6 ⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆)) |
| 17 | ffn 5531 | . . . . . 6 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) → 𝑅 Fn ω) | |
| 18 | 16, 17 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑅 Fn ω) |
| 19 | peano1 4739 | . . . . 5 ⊢ ∅ ∈ ω | |
| 20 | fnfvelrn 5834 | . . . . 5 ⊢ ((𝑅 Fn ω ∧ ∅ ∈ ω) → (𝑅‘∅) ∈ ran 𝑅) | |
| 21 | 18, 19, 20 | sylancl 417 | . . . 4 ⊢ (𝜑 → (𝑅‘∅) ∈ ran 𝑅) |
| 22 | 15, 21 | eqeltrrd 2316 | . . 3 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ ran 𝑅) |
| 23 | 22, 6 | eleqtrrd 2318 | . 2 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ 𝑇) |
| 24 | funopfv 5737 | . 2 ⊢ (Fun 𝑇 → (〈𝐶, 𝐴〉 ∈ 𝑇 → (𝑇‘𝐶) = 𝐴)) | |
| 25 | 9, 23, 24 | sylc 62 | 1 ⊢ (𝜑 → (𝑇‘𝐶) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∅c0 3520 〈cop 3711 ↦ cmpt 4190 ωcom 4735 × cxp 4770 ran crn 4773 Fun wfun 5369 Fn wfn 5370 ⟶wf 5371 ‘cfv 5375 (class class class)co 6079 ∈ cmpo 6081 freccfrec 6655 1c1 8174 + caddc 8176 ℤcz 9627 ℤ≥cuz 9904 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-ilim 4512 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-frec 6656 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-n0 9547 df-z 9628 df-uz 9905 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |