Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > seq3p1 | GIF version |
Description: Value of the sequence builder function at a successor. (Contributed by Jim Kingdon, 30-Apr-2022.) |
Ref | Expression |
---|---|
seq3p1.m | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
seq3p1.f | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) |
seq3p1.pl | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) |
Ref | Expression |
---|---|
seq3p1 | ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | seq3p1.m | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
2 | eluzel2 9331 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
4 | fveq2 5421 | . . . . . 6 ⊢ (𝑥 = 𝑀 → (𝐹‘𝑥) = (𝐹‘𝑀)) | |
5 | 4 | eleq1d 2208 | . . . . 5 ⊢ (𝑥 = 𝑀 → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘𝑀) ∈ 𝑆)) |
6 | seq3p1.f | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) | |
7 | 6 | ralrimiva 2505 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)(𝐹‘𝑥) ∈ 𝑆) |
8 | uzid 9340 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
9 | 3, 8 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀)) |
10 | 5, 7, 9 | rspcdva 2794 | . . . 4 ⊢ (𝜑 → (𝐹‘𝑀) ∈ 𝑆) |
11 | ssv 3119 | . . . . 5 ⊢ 𝑆 ⊆ V | |
12 | 11 | a1i 9 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ V) |
13 | seq3p1.pl | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
14 | 6, 13 | iseqovex 10229 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝑀) ∧ 𝑦 ∈ 𝑆)) → (𝑥(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦) ∈ 𝑆) |
15 | iseqvalcbv 10230 | . . . 4 ⊢ frec((𝑎 ∈ (ℤ≥‘𝑀), 𝑏 ∈ V ↦ 〈(𝑎 + 1), (𝑎(𝑐 ∈ (ℤ≥‘𝑀), 𝑑 ∈ 𝑆 ↦ (𝑑 + (𝐹‘(𝑐 + 1))))𝑏)〉), 〈𝑀, (𝐹‘𝑀)〉) = frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)〉), 〈𝑀, (𝐹‘𝑀)〉) | |
16 | 3, 15, 6, 13 | seq3val 10231 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹) = ran frec((𝑎 ∈ (ℤ≥‘𝑀), 𝑏 ∈ V ↦ 〈(𝑎 + 1), (𝑎(𝑐 ∈ (ℤ≥‘𝑀), 𝑑 ∈ 𝑆 ↦ (𝑑 + (𝐹‘(𝑐 + 1))))𝑏)〉), 〈𝑀, (𝐹‘𝑀)〉)) |
17 | 3, 10, 12, 14, 15, 16 | frecuzrdgsuct 10197 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁))) |
18 | 1, 17 | mpdan 417 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁))) |
19 | eqid 2139 | . . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀) | |
20 | 19, 3, 6, 13 | seqf 10234 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆) |
21 | 20, 1 | ffvelrnd 5556 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ∈ 𝑆) |
22 | fveq2 5421 | . . . . . 6 ⊢ (𝑥 = (𝑁 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑁 + 1))) | |
23 | 22 | eleq1d 2208 | . . . . 5 ⊢ (𝑥 = (𝑁 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑁 + 1)) ∈ 𝑆)) |
24 | peano2uz 9378 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
25 | 1, 24 | syl 14 | . . . . 5 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) |
26 | 23, 7, 25 | rspcdva 2794 | . . . 4 ⊢ (𝜑 → (𝐹‘(𝑁 + 1)) ∈ 𝑆) |
27 | 13, 21, 26 | caovcld 5924 | . . 3 ⊢ (𝜑 → ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1))) ∈ 𝑆) |
28 | fvoveq1 5797 | . . . . 5 ⊢ (𝑧 = 𝑁 → (𝐹‘(𝑧 + 1)) = (𝐹‘(𝑁 + 1))) | |
29 | 28 | oveq2d 5790 | . . . 4 ⊢ (𝑧 = 𝑁 → (𝑤 + (𝐹‘(𝑧 + 1))) = (𝑤 + (𝐹‘(𝑁 + 1)))) |
30 | oveq1 5781 | . . . 4 ⊢ (𝑤 = (seq𝑀( + , 𝐹)‘𝑁) → (𝑤 + (𝐹‘(𝑁 + 1))) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) | |
31 | eqid 2139 | . . . 4 ⊢ (𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) = (𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) | |
32 | 29, 30, 31 | ovmpog 5905 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (seq𝑀( + , 𝐹)‘𝑁) ∈ 𝑆 ∧ ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1))) ∈ 𝑆) → (𝑁(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
33 | 1, 21, 27, 32 | syl3anc 1216 | . 2 ⊢ (𝜑 → (𝑁(𝑧 ∈ (ℤ≥‘𝑀), 𝑤 ∈ 𝑆 ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
34 | 18, 33 | eqtrd 2172 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 Vcvv 2686 ⊆ wss 3071 〈cop 3530 ‘cfv 5123 (class class class)co 5774 ∈ cmpo 5776 freccfrec 6287 1c1 7621 + caddc 7623 ℤcz 9054 ℤ≥cuz 9326 seqcseq 10218 |
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-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-3or 963 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-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 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-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-z 9055 df-uz 9327 df-seqfrec 10219 |
This theorem is referenced by: seq3clss 10240 seq3m1 10241 seq3fveq2 10242 seq3shft2 10246 ser3mono 10251 seq3split 10252 seq3caopr3 10254 seq3id3 10280 seq3id2 10282 seq3homo 10283 seq3z 10284 ser3ge0 10290 exp3vallem 10294 expp1 10300 facp1 10476 seq3coll 10585 resqrexlemfp1 10781 climserle 11114 clim2prod 11308 prodfap0 11314 prodfrecap 11315 ege2le3 11377 efgt1p2 11401 efgt1p 11402 algrp1 11727 |
Copyright terms: Public domain | W3C validator |