Theorem 2wlkdlem4 26824

Description: Lemma 4 for 2wlkd 26832. (Contributed by AV, 14-Feb-2021.)

Hypotheses

Ref	Expression
2wlkd.p	|- P = <" A B C ">
2wlkd.f	|- F = <" J K ">
2wlkd.s	|- ( ph -> ( A e. V /\ B e. V /\ C e. V ) )

Assertion

Ref	Expression
2wlkdlem4	|- ( ph -> A. k e. ( 0 ... ( # ` F ) ) ( P ` k ) e. V )

Distinct variable groups:   k, F   P, k   k, V

Allowed substitution hints:   ph( k)   A( k)   B( k)   C( k)   J( k)   K( k)

Proof of Theorem 2wlkdlem4

Step	Hyp	Ref	Expression
1		2wlkd.s	. . 3 |- ( ph -> ( A e. V /\ B e. V /\ C e. V ) )
2		2wlkd.p	. . . . 5 |- P = <" A B C ">
3		2wlkd.f	. . . . 5 |- F = <" J K ">
4	2, 3, 1	2wlkdlem3 26823	. . . 4 |- ( ph -> ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) )
5		simp1 1061	. . . . . . 7 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( P ` 0 ) = A )
6	5	eleq1d 2686	. . . . . 6 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( ( P ` 0 ) e. V <-> A e. V ) )
7		simp2 1062	. . . . . . 7 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( P ` 1 ) = B )
8	7	eleq1d 2686	. . . . . 6 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( ( P ` 1 ) e. V <-> B e. V ) )
9		simp3 1063	. . . . . . 7 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( P ` 2 ) = C )
10	9	eleq1d 2686	. . . . . 6 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( ( P ` 2 ) e. V <-> C e. V ) )
11	6, 8, 10	3anbi123d 1399	. . . . 5 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( ( ( P ` 0 ) e. V /\ ( P ` 1 ) e. V /\ ( P ` 2 ) e. V ) <-> ( A e. V /\ B e. V /\ C e. V ) ) )
12	11	bicomd 213	. . . 4 |- ( ( ( P ` 0 ) = A /\ ( P ` 1 ) = B /\ ( P ` 2 ) = C ) -> ( ( A e. V /\ B e. V /\ C e. V ) <-> ( ( P ` 0 ) e. V /\ ( P ` 1 ) e. V /\ ( P ` 2 ) e. V ) ) )
13	4, 12	syl 17	. . 3 |- ( ph -> ( ( A e. V /\ B e. V /\ C e. V ) <-> ( ( P ` 0 ) e. V /\ ( P ` 1 ) e. V /\ ( P ` 2 ) e. V ) ) )
14	1, 13	mpbid 222	. 2 |- ( ph -> ( ( P ` 0 ) e. V /\ ( P ` 1 ) e. V /\ ( P ` 2 ) e. V ) )
15	3	fveq2i 6194	. . . . . . 7 |- ( # ` F ) = ( # ` <" J K "> )
16		s2len 13634	. . . . . . 7 |- ( # ` <" J K "> ) = 2
17	15, 16	eqtri 2644	. . . . . 6 |- ( # ` F ) = 2
18	17	oveq2i 6661	. . . . 5 |- ( 0 ... ( # ` F ) ) = ( 0 ... 2 )
19		fz0tp 12440	. . . . 5 |- ( 0 ... 2 ) = { 0 , 1 , 2 }
20	18, 19	eqtri 2644	. . . 4 |- ( 0 ... ( # ` F ) ) = { 0 , 1 , 2 }
21	20	raleqi 3142	. . 3 |- ( A. k e. ( 0 ... ( # ` F ) ) ( P ` k ) e. V <-> A. k e. { 0 , 1 , 2 } ( P ` k ) e. V )
22		c0ex 10034	. . . 4 |- 0 e. _V
23		1ex 10035	. . . 4 |- 1 e. _V
24		2ex 11092	. . . 4 |- 2 e. _V
25		fveq2 6191	. . . . 5 |- ( k = 0 -> ( P ` k ) = ( P ` 0 ) )
26	25	eleq1d 2686	. . . 4 |- ( k = 0 -> ( ( P ` k ) e. V <-> ( P ` 0 ) e. V ) )
27		fveq2 6191	. . . . 5 |- ( k = 1 -> ( P ` k ) = ( P ` 1 ) )
28	27	eleq1d 2686	. . . 4 |- ( k = 1 -> ( ( P ` k ) e. V <-> ( P ` 1 ) e. V ) )
29		fveq2 6191	. . . . 5 |- ( k = 2 -> ( P ` k ) = ( P ` 2 ) )
30	29	eleq1d 2686	. . . 4 |- ( k = 2 -> ( ( P ` k ) e. V <-> ( P ` 2 ) e. V ) )
31	22, 23, 24, 26, 28, 30	raltp 4240	. . 3 |- ( A. k e. { 0 , 1 , 2 } ( P ` k ) e. V <-> ( ( P ` 0 ) e. V /\ ( P ` 1 ) e. V /\ ( P ` 2 ) e. V ) )
32	21, 31	bitri 264	. 2 |- ( A. k e. ( 0 ... ( # ` F ) ) ( P ` k ) e. V <-> ( ( P ` 0 ) e. V /\ ( P ` 1 ) e. V /\ ( P ` 2 ) e. V ) )
33	14, 32	sylibr 224	1 |- ( ph -> A. k e. ( 0 ... ( # ` F ) ) ( P ` k ) e. V )

Syntax hints:   -> wi 4   <-> wb 196   /\ w3a 1037   = wceq 1483   e. wcel 1990   A.wral 2912   {ctp 4181   ` cfv 5888  (class class class)co 6650   0cc0 9936   1c1 9937   2c2 11070   ...cfz 12326   #chash 13117   <"cs2 13586   <"cs3 13587

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-n0 11293  df-z 11378  df-uz 11688  df-fz 12327  df-fzo 12466  df-hash 13118  df-word 13299  df-concat 13301  df-s1 13302  df-s2 13593  df-s3 13594

This theorem is referenced by:  2wlkd  26832