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 5415 | . 2 ⊢ (𝐺‘∅) = (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) |
3 | frec2uz.1 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
4 | frec0g 6287 | . . 3 ⊢ (𝐶 ∈ ℤ → (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) = 𝐶) | |
5 | 3, 4 | syl 14 | . 2 ⊢ (𝜑 → (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) = 𝐶) |
6 | 2, 5 | syl5eq 2182 | 1 ⊢ (𝜑 → (𝐺‘∅) = 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1331 ∈ wcel 1480 ∅c0 3358 ↦ cmpt 3984 ‘cfv 5118 (class class class)co 5767 freccfrec 6280 1c1 7614 + caddc 7616 ℤcz 9047 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-nul 4049 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-ral 2419 df-rex 2420 df-rab 2423 df-v 2683 df-sbc 2905 df-csb 2999 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-nul 3359 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-iun 3810 df-br 3925 df-opab 3985 df-mpt 3986 df-tr 4022 df-id 4210 df-iord 4283 df-on 4285 df-suc 4288 df-iom 4500 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-res 4546 df-iota 5083 df-fun 5120 df-fn 5121 df-fv 5126 df-recs 6195 df-frec 6281 |
This theorem is referenced by: frec2uzuzd 10168 frec2uzrand 10171 frec2uzrdg 10175 frecuzrdgg 10182 frecfzennn 10192 0tonninf 10205 1tonninf 10206 omgadd 10541 ennnfonelem1 11909 ennnfonelemhf1o 11915 isomninnlem 13214 |
Copyright terms: Public domain | W3C validator |