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 5422 | . 2 ⊢ (𝐺‘∅) = (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) |
3 | frec2uz.1 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
4 | frec0g 6294 | . . 3 ⊢ (𝐶 ∈ ℤ → (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) = 𝐶) | |
5 | 3, 4 | syl 14 | . 2 ⊢ (𝜑 → (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)‘∅) = 𝐶) |
6 | 2, 5 | syl5eq 2184 | 1 ⊢ (𝜑 → (𝐺‘∅) = 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1331 ∈ wcel 1480 ∅c0 3363 ↦ cmpt 3989 ‘cfv 5123 (class class class)co 5774 freccfrec 6287 1c1 7621 + caddc 7623 ℤcz 9054 |
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 2121 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 |
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 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-iord 4288 df-on 4290 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-res 4551 df-iota 5088 df-fun 5125 df-fn 5126 df-fv 5131 df-recs 6202 df-frec 6288 |
This theorem is referenced by: frec2uzuzd 10175 frec2uzrand 10178 frec2uzrdg 10182 frecuzrdgg 10189 frecfzennn 10199 0tonninf 10212 1tonninf 10213 omgadd 10548 ennnfonelem1 11920 ennnfonelemhf1o 11926 isomninnlem 13225 |
Copyright terms: Public domain | W3C validator |