Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > frecuzrdgrom | GIF version |
Description: The function 𝑅 (used in the definition of the recursive definition generator on upper integers) is a function defined for all natural numbers. (Contributed by Jim Kingdon, 26-May-2020.) |
Ref | Expression |
---|---|
frec2uz.1 | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
frec2uz.2 | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) |
uzrdg.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
uzrdg.a | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
uzrdg.f | ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆) |
uzrdg.2 | ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) |
Ref | Expression |
---|---|
frecuzrdgrom | ⊢ (𝜑 → 𝑅 Fn ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zex 8254 | . . . . . . 7 ⊢ ℤ ∈ V | |
2 | uzssz 8492 | . . . . . . 7 ⊢ (ℤ≥‘𝐶) ⊆ ℤ | |
3 | 1, 2 | ssexi 3895 | . . . . . 6 ⊢ (ℤ≥‘𝐶) ∈ V |
4 | uzrdg.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
5 | mpt2exga 5835 | . . . . . 6 ⊢ (((ℤ≥‘𝐶) ∈ V ∧ 𝑆 ∈ 𝑉) → (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉) ∈ V) | |
6 | 3, 4, 5 | sylancr 393 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉) ∈ V) |
7 | vex 2560 | . . . . 5 ⊢ 𝑧 ∈ V | |
8 | fvexg 5194 | . . . . 5 ⊢ (((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉) ∈ V ∧ 𝑧 ∈ V) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉)‘𝑧) ∈ V) | |
9 | 6, 7, 8 | sylancl 392 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉)‘𝑧) ∈ V) |
10 | 9 | alrimiv 1754 | . . 3 ⊢ (𝜑 → ∀𝑧((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉)‘𝑧) ∈ V) |
11 | frec2uz.1 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
12 | uzid 8487 | . . . . 5 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶)) | |
13 | 11, 12 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (ℤ≥‘𝐶)) |
14 | uzrdg.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
15 | opelxp 4374 | . . . 4 ⊢ (〈𝐶, 𝐴〉 ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ (𝐶 ∈ (ℤ≥‘𝐶) ∧ 𝐴 ∈ 𝑆)) | |
16 | 13, 14, 15 | sylanbrc 394 | . . 3 ⊢ (𝜑 → 〈𝐶, 𝐴〉 ∈ ((ℤ≥‘𝐶) × 𝑆)) |
17 | frecfnom 5986 | . . 3 ⊢ ((∀𝑧((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉)‘𝑧) ∈ V ∧ 〈𝐶, 𝐴〉 ∈ ((ℤ≥‘𝐶) × 𝑆)) → frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) Fn ω) | |
18 | 10, 16, 17 | syl2anc 391 | . 2 ⊢ (𝜑 → frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) Fn ω) |
19 | uzrdg.2 | . . 3 ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) | |
20 | 19 | fneq1i 4993 | . 2 ⊢ (𝑅 Fn ω ↔ frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ 〈(𝑥 + 1), (𝑥𝐹𝑦)〉), 〈𝐶, 𝐴〉) Fn ω) |
21 | 18, 20 | sylibr 137 | 1 ⊢ (𝜑 → 𝑅 Fn ω) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ∀wal 1241 = wceq 1243 ∈ wcel 1393 Vcvv 2557 〈cop 3378 ↦ cmpt 3818 ωcom 4313 × cxp 4343 Fn wfn 4897 ‘cfv 4902 (class class class)co 5512 ↦ cmpt2 5514 freccfrec 5977 1c1 6890 + caddc 6892 ℤcz 8245 ℤ≥cuz 8473 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 ax-cnex 6975 ax-resscn 6976 ax-pre-ltirr 6996 |
This theorem depends on definitions: df-bi 110 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-nel 2207 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-frec 5978 df-pnf 7062 df-mnf 7063 df-xr 7064 df-ltxr 7065 df-le 7066 df-neg 7185 df-z 8246 df-uz 8474 |
This theorem is referenced by: frecuzrdglem 9197 frecuzrdgfn 9198 frecuzrdg0 9200 |
Copyright terms: Public domain | W3C validator |