| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frec2uz0d | GIF version | ||
| Description: The mapping 𝐺 is a one-to-one mapping from ω onto upper integers that will be used to construct a recursive definition generator. Ordinal natural number 0 maps to complex number 𝐶 (normally 0 for the upper integers ℕ0 or 1 for the upper integers ℕ), 1 maps to 𝐶 + 1, etc. This theorem shows the value of 𝐺 at ordinal natural number zero. (Contributed by Jim Kingdon, 16-May-2020.) |
| Ref | Expression |
|---|---|
| frec2uz.1 | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| frec2uz.2 | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) |
| Ref | Expression |
|---|---|
| frec2uz0d | ⊢ (𝜑 → (𝐺‘∅) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frec2uz.2 | . . 3 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) | |
| 2 | 1 | fveq1i 5696 | . 2 ⊢ (𝐺‘∅) = (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) |
| 3 | frec2uz.1 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
| 4 | frec0g 6668 | . . 3 ⊢ (𝐶 ∈ ℤ → (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) = 𝐶) | |
| 5 | 3, 4 | syl 14 | . 2 ⊢ (𝜑 → (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) = 𝐶) |
| 6 | 2, 5 | eqtrid 2283 | 1 ⊢ (𝜑 → (𝐺‘∅) = 𝐶) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ∅c0 3520 ↦ cmpt 4192 ‘cfv 5377 (class class class)co 6085 freccfrec 6661 1c1 8180 + caddc 8182 ℤcz 9644 |
| This proof depends on 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-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 |
| This proof depends on definitions: df-bi 117 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-ral 2533 df-rex 2534 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 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-res 4786 df-iota 5337 df-fun 5379 df-fn 5380 df-fv 5385 df-recs 6576 df-frec 6662 |
| This theorem is used by: frec2uzuzd 10839 frec2uzrand 10842 frec2uzrdg 10846 frecuzrdgg 10853 frecfzennn 10863 0tonninf 10877 1tonninf 10878 omgadd 11242 ennnfonelem1 13298 ennnfonelemhf1o 13304 012of 17023 2o01f 17024 isomninnlem 17079 iswomninnlem 17099 ismkvnnlem 17102 |
| Copyright terms: Public domain | W3C validator |