Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ialgrp1 | GIF version |
Description: The value of the algorithm iterator 𝑅 at (𝐾 + 1). (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 27-Dec-2014.) |
Ref | Expression |
---|---|
algrf.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
algrf.2 | ⊢ 𝑅 = seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆) |
algrf.3 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
algrf.4 | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
algrf.5 | ⊢ (𝜑 → 𝐹:𝑆⟶𝑆) |
algrf.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
Ref | Expression |
---|---|
ialgrp1 | ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → (𝑅‘(𝐾 + 1)) = (𝐹‘(𝑅‘𝐾))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | algrf.2 | . . . 4 ⊢ 𝑅 = seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆) | |
2 | 1 | fveq1i 5179 | . . 3 ⊢ (𝑅‘(𝐾 + 1)) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘(𝐾 + 1)) |
3 | simpr 103 | . . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → 𝐾 ∈ 𝑍) | |
4 | algrf.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
5 | 3, 4 | syl6eleq 2130 | . . . 4 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → 𝐾 ∈ (ℤ≥‘𝑀)) |
6 | algrf.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
7 | 6 | adantr 261 | . . . 4 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → 𝑆 ∈ 𝑉) |
8 | algrf.4 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
9 | 8 | adantr 261 | . . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → 𝐴 ∈ 𝑆) |
10 | 4, 9 | ialgrlemconst 9882 | . . . 4 ⊢ (((𝜑 ∧ 𝐾 ∈ 𝑍) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → ((𝑍 × {𝐴})‘𝑥) ∈ 𝑆) |
11 | algrf.5 | . . . . . 6 ⊢ (𝜑 → 𝐹:𝑆⟶𝑆) | |
12 | 11 | adantr 261 | . . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → 𝐹:𝑆⟶𝑆) |
13 | 12 | ialgrlem1st 9881 | . . . 4 ⊢ (((𝜑 ∧ 𝐾 ∈ 𝑍) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥(𝐹 ∘ 1st )𝑦) ∈ 𝑆) |
14 | 5, 7, 10, 13 | iseqp1 9225 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘(𝐾 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝐾 + 1)))) |
15 | 2, 14 | syl5eq 2084 | . 2 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → (𝑅‘(𝐾 + 1)) = ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝐾 + 1)))) |
16 | 5, 7, 10, 13 | iseqcl 9223 | . . . 4 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾) ∈ 𝑆) |
17 | 4 | peano2uzs 8527 | . . . . . 6 ⊢ (𝐾 ∈ 𝑍 → (𝐾 + 1) ∈ 𝑍) |
18 | fvconst2g 5375 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑆 ∧ (𝐾 + 1) ∈ 𝑍) → ((𝑍 × {𝐴})‘(𝐾 + 1)) = 𝐴) | |
19 | 8, 17, 18 | syl2an 273 | . . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → ((𝑍 × {𝐴})‘(𝐾 + 1)) = 𝐴) |
20 | 19, 9 | eqeltrd 2114 | . . . 4 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → ((𝑍 × {𝐴})‘(𝐾 + 1)) ∈ 𝑆) |
21 | algrflemg 5851 | . . . 4 ⊢ (((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾) ∈ 𝑆 ∧ ((𝑍 × {𝐴})‘(𝐾 + 1)) ∈ 𝑆) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝐾 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾))) | |
22 | 16, 20, 21 | syl2anc 391 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝐾 + 1))) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾))) |
23 | 1 | fveq1i 5179 | . . . 4 ⊢ (𝑅‘𝐾) = (seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾) |
24 | 23 | fveq2i 5181 | . . 3 ⊢ (𝐹‘(𝑅‘𝐾)) = (𝐹‘(seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾)) |
25 | 22, 24 | syl6reqr 2091 | . 2 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → (𝐹‘(𝑅‘𝐾)) = ((seq𝑀((𝐹 ∘ 1st ), (𝑍 × {𝐴}), 𝑆)‘𝐾)(𝐹 ∘ 1st )((𝑍 × {𝐴})‘(𝐾 + 1)))) |
26 | 15, 25 | eqtr4d 2075 | 1 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑍) → (𝑅‘(𝐾 + 1)) = (𝐹‘(𝑅‘𝐾))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 {csn 3375 × cxp 4343 ∘ ccom 4349 ⟶wf 4898 ‘cfv 4902 (class class class)co 5512 1st c1st 5765 1c1 6890 + caddc 6892 ℤcz 8245 ℤ≥cuz 8473 seqcseq 9211 |
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-1cn 6977 ax-1re 6978 ax-icn 6979 ax-addcl 6980 ax-addrcl 6981 ax-mulcl 6982 ax-addcom 6984 ax-addass 6986 ax-distr 6988 ax-i2m1 6989 ax-0id 6992 ax-rnegex 6993 ax-cnre 6995 ax-pre-ltirr 6996 ax-pre-ltwlin 6997 ax-pre-lttrn 6998 ax-pre-ltadd 7000 |
This theorem depends on definitions: df-bi 110 df-dc 743 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-eprel 4026 df-id 4030 df-po 4033 df-iso 4034 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-riota 5468 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-frec 5978 df-1o 6001 df-2o 6002 df-oadd 6005 df-omul 6006 df-er 6106 df-ec 6108 df-qs 6112 df-ni 6402 df-pli 6403 df-mi 6404 df-lti 6405 df-plpq 6442 df-mpq 6443 df-enq 6445 df-nqqs 6446 df-plqqs 6447 df-mqqs 6448 df-1nqqs 6449 df-rq 6450 df-ltnqqs 6451 df-enq0 6522 df-nq0 6523 df-0nq0 6524 df-plq0 6525 df-mq0 6526 df-inp 6564 df-i1p 6565 df-iplp 6566 df-iltp 6568 df-enr 6811 df-nr 6812 df-ltr 6815 df-0r 6816 df-1r 6817 df-0 6896 df-1 6897 df-r 6899 df-lt 6902 df-pnf 7062 df-mnf 7063 df-xr 7064 df-ltxr 7065 df-le 7066 df-sub 7184 df-neg 7185 df-inn 7915 df-n0 8182 df-z 8246 df-uz 8474 df-iseq 9212 |
This theorem is referenced by: ialginv 9886 ialgcvg 9887 ialgcvga 9890 ialgfx 9891 |
Copyright terms: Public domain | W3C validator |