Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > seq1cd | GIF version |
Description: Initial value of the recursive sequence builder. A version of seq3-1 10385 which provides two classes 𝐷 and 𝐶 for the terms and the value being accumulated, respectively. (Contributed by Jim Kingdon, 19-Jul-2023.) |
Ref | Expression |
---|---|
seq1cd.1 | ⊢ (𝜑 → (𝐹‘𝑀) ∈ 𝐶) |
seq1cd.2 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) → (𝑥 + 𝑦) ∈ 𝐶) |
seq1cd.4 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
seq1cd.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐹‘𝑥) ∈ 𝐷) |
Ref | Expression |
---|---|
seq1cd | ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | seq1cd.4 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
2 | seq1cd.1 | . 2 ⊢ (𝜑 → (𝐹‘𝑀) ∈ 𝐶) | |
3 | ssv 3159 | . . 3 ⊢ 𝐶 ⊆ V | |
4 | 3 | a1i 9 | . 2 ⊢ (𝜑 → 𝐶 ⊆ V) |
5 | seq1cd.5 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐹‘𝑥) ∈ 𝐷) | |
6 | seq1cd.2 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) → (𝑥 + 𝑦) ∈ 𝐶) | |
7 | 5, 6 | seqovcd 10388 | . 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝑀) ∧ 𝑦 ∈ 𝐶)) → (𝑥(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝐶 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦) ∈ 𝐶) |
8 | iseqvalcbv 10382 | . 2 ⊢ frec((𝑠 ∈ (ℤ≥‘𝑀), 𝑡 ∈ V ↦ 〈(𝑠 + 1), (𝑠(𝑢 ∈ (ℤ≥‘𝑀), 𝑣 ∈ 𝐶 ↦ (𝑣 + (𝐹‘(𝑢 + 1))))𝑡)〉), 〈𝑀, (𝐹‘𝑀)〉) = frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝐶 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)〉), 〈𝑀, (𝐹‘𝑀)〉) | |
9 | 1, 8, 2, 6, 5 | seqvalcd 10384 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) = ran frec((𝑠 ∈ (ℤ≥‘𝑀), 𝑡 ∈ V ↦ 〈(𝑠 + 1), (𝑠(𝑢 ∈ (ℤ≥‘𝑀), 𝑣 ∈ 𝐶 ↦ (𝑣 + (𝐹‘(𝑢 + 1))))𝑡)〉), 〈𝑀, (𝐹‘𝑀)〉)) |
10 | 1, 2, 4, 7, 8, 9 | frecuzrdg0t 10347 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1342 ∈ wcel 2135 Vcvv 2721 ⊆ wss 3111 〈cop 3573 ‘cfv 5182 (class class class)co 5836 ∈ cmpo 5838 freccfrec 6349 1c1 7745 + caddc 7747 ℤcz 9182 ℤ≥cuz 9457 seqcseq 10370 |
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 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-coll 4091 ax-sep 4094 ax-nul 4102 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-iinf 4559 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-addcom 7844 ax-addass 7846 ax-distr 7848 ax-i2m1 7849 ax-0lt1 7850 ax-0id 7852 ax-rnegex 7853 ax-cnre 7855 ax-pre-ltirr 7856 ax-pre-ltwlin 7857 ax-pre-lttrn 7858 ax-pre-ltadd 7860 |
This theorem depends on definitions: df-bi 116 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-nul 3405 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-iun 3862 df-br 3977 df-opab 4038 df-mpt 4039 df-tr 4075 df-id 4265 df-iord 4338 df-on 4340 df-ilim 4341 df-suc 4343 df-iom 4562 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-f1 5187 df-fo 5188 df-f1o 5189 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-1st 6100 df-2nd 6101 df-recs 6264 df-frec 6350 df-pnf 7926 df-mnf 7927 df-xr 7928 df-ltxr 7929 df-le 7930 df-sub 8062 df-neg 8063 df-inn 8849 df-n0 9106 df-z 9183 df-uz 9458 df-seqfrec 10371 |
This theorem is referenced by: ennnfonelem0 12275 |
Copyright terms: Public domain | W3C validator |