![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iseqf1olemqval | GIF version |
Description: Lemma for seq3f1o 10503. Value of the function 𝑄. (Contributed by Jim Kingdon, 28-Aug-2022.) |
Ref | Expression |
---|---|
iseqf1olemqcl.k | ⊢ (𝜑 → 𝐾 ∈ (𝑀...𝑁)) |
iseqf1olemqcl.j | ⊢ (𝜑 → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)) |
iseqf1olemqcl.a | ⊢ (𝜑 → 𝐴 ∈ (𝑀...𝑁)) |
iseqf1olemqval.q | ⊢ 𝑄 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) |
Ref | Expression |
---|---|
iseqf1olemqval | ⊢ (𝜑 → (𝑄‘𝐴) = if(𝐴 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1))), (𝐽‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iseqf1olemqcl.a | . 2 ⊢ (𝜑 → 𝐴 ∈ (𝑀...𝑁)) | |
2 | iseqf1olemqcl.k | . . 3 ⊢ (𝜑 → 𝐾 ∈ (𝑀...𝑁)) | |
3 | iseqf1olemqcl.j | . . 3 ⊢ (𝜑 → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)) | |
4 | 2, 3, 1 | iseqf1olemqcl 10485 | . 2 ⊢ (𝜑 → if(𝐴 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1))), (𝐽‘𝐴)) ∈ (𝑀...𝑁)) |
5 | eleq1 2240 | . . . 4 ⊢ (𝑢 = 𝐴 → (𝑢 ∈ (𝐾...(◡𝐽‘𝐾)) ↔ 𝐴 ∈ (𝐾...(◡𝐽‘𝐾)))) | |
6 | eqeq1 2184 | . . . . 5 ⊢ (𝑢 = 𝐴 → (𝑢 = 𝐾 ↔ 𝐴 = 𝐾)) | |
7 | oveq1 5881 | . . . . . 6 ⊢ (𝑢 = 𝐴 → (𝑢 − 1) = (𝐴 − 1)) | |
8 | 7 | fveq2d 5519 | . . . . 5 ⊢ (𝑢 = 𝐴 → (𝐽‘(𝑢 − 1)) = (𝐽‘(𝐴 − 1))) |
9 | 6, 8 | ifbieq2d 3558 | . . . 4 ⊢ (𝑢 = 𝐴 → if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))) = if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1)))) |
10 | fveq2 5515 | . . . 4 ⊢ (𝑢 = 𝐴 → (𝐽‘𝑢) = (𝐽‘𝐴)) | |
11 | 5, 9, 10 | ifbieq12d 3560 | . . 3 ⊢ (𝑢 = 𝐴 → if(𝑢 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)) = if(𝐴 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1))), (𝐽‘𝐴))) |
12 | iseqf1olemqval.q | . . 3 ⊢ 𝑄 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) | |
13 | 11, 12 | fvmptg 5592 | . 2 ⊢ ((𝐴 ∈ (𝑀...𝑁) ∧ if(𝐴 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1))), (𝐽‘𝐴)) ∈ (𝑀...𝑁)) → (𝑄‘𝐴) = if(𝐴 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1))), (𝐽‘𝐴))) |
14 | 1, 4, 13 | syl2anc 411 | 1 ⊢ (𝜑 → (𝑄‘𝐴) = if(𝐴 ∈ (𝐾...(◡𝐽‘𝐾)), if(𝐴 = 𝐾, 𝐾, (𝐽‘(𝐴 − 1))), (𝐽‘𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1353 ∈ wcel 2148 ifcif 3534 ↦ cmpt 4064 ◡ccnv 4625 –1-1-onto→wf1o 5215 ‘cfv 5216 (class class class)co 5874 1c1 7811 − cmin 8127 ...cfz 10007 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4121 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-addcom 7910 ax-addass 7912 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-0id 7918 ax-rnegex 7919 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-ltadd 7926 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-br 4004 df-opab 4065 df-mpt 4066 df-id 4293 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-inn 8919 df-n0 9176 df-z 9253 df-uz 9528 df-fz 10008 |
This theorem is referenced by: iseqf1olemnab 10487 iseqf1olemab 10488 iseqf1olemnanb 10489 iseqf1olemqk 10493 seq3f1olemqsumkj 10497 seq3f1olemqsumk 10498 |
Copyright terms: Public domain | W3C validator |