Theorem fztpval 10291

Description: Two ways of defining the first three values of a sequence on NN. (Contributed by NM, 13-Sep-2011.)

Assertion

Ref	Expression
fztpval	|- ( A. x e. ( 1 ... 3 ) ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> ( ( F ` 1 ) = A /\ ( F ` 2 ) = B /\ ( F ` 3 ) = C ) )

Distinct variable groups:   x, A   x, B   x, C   x, F

Proof of Theorem fztpval

Step	Hyp	Ref	Expression
1		1z 9483	. . . . 5 |- 1 e. ZZ
2		fztp 10286	. . . . 5 |- ( 1 e. ZZ -> ( 1 ... ( 1 + 2 ) ) = { 1 , ( 1 + 1 ) , ( 1 + 2 ) } )
3	1, 2	ax-mp 5	. . . 4 |- ( 1 ... ( 1 + 2 ) ) = { 1 , ( 1 + 1 ) , ( 1 + 2 ) }
4		df-3 9181	. . . . . 6 |- 3 = ( 2 + 1 )
5		2cn 9192	. . . . . . 7 |- 2 e. CC
6		ax-1cn 8103	. . . . . . 7 |- 1 e. CC
7	5, 6	addcomi 8301	. . . . . 6 |- ( 2 + 1 ) = ( 1 + 2 )
8	4, 7	eqtri 2250	. . . . 5 |- 3 = ( 1 + 2 )
9	8	oveq2i 6018	. . . 4 |- ( 1 ... 3 ) = ( 1 ... ( 1 + 2 ) )
10		tpeq3 3754	. . . . . 6 |- ( 3 = ( 1 + 2 ) -> { 1 , 2 , 3 } = { 1 , 2 , ( 1 + 2 ) } )
11	8, 10	ax-mp 5	. . . . 5 |- { 1 , 2 , 3 } = { 1 , 2 , ( 1 + 2 ) }
12		df-2 9180	. . . . . 6 |- 2 = ( 1 + 1 )
13		tpeq2 3753	. . . . . 6 |- ( 2 = ( 1 + 1 ) -> { 1 , 2 , ( 1 + 2 ) } = { 1 , ( 1 + 1 ) , ( 1 + 2 ) } )
14	12, 13	ax-mp 5	. . . . 5 |- { 1 , 2 , ( 1 + 2 ) } = { 1 , ( 1 + 1 ) , ( 1 + 2 ) }
15	11, 14	eqtri 2250	. . . 4 |- { 1 , 2 , 3 } = { 1 , ( 1 + 1 ) , ( 1 + 2 ) }
16	3, 9, 15	3eqtr4i 2260	. . 3 |- ( 1 ... 3 ) = { 1 , 2 , 3 }
17	16	raleqi 2732	. 2 |- ( A. x e. ( 1 ... 3 ) ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> A. x e. { 1 , 2 , 3 } ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) )
18		1ex 8152	. . 3 |- 1 e. _V
19		2ex 9193	. . 3 |- 2 e. _V
20		3ex 9197	. . 3 |- 3 e. _V
21		fveq2 5629	. . . 4 |- ( x = 1 -> ( F ` x ) = ( F ` 1 ) )
22		iftrue 3607	. . . 4 |- ( x = 1 -> if ( x = 1 , A , if ( x = 2 , B , C ) ) = A )
23	21, 22	eqeq12d 2244	. . 3 |- ( x = 1 -> ( ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> ( F ` 1 ) = A ) )
24		fveq2 5629	. . . 4 |- ( x = 2 -> ( F ` x ) = ( F ` 2 ) )
25		1re 8156	. . . . . . . 8 |- 1 e. RR
26		1lt2 9291	. . . . . . . 8 |- 1 < 2
27	25, 26	gtneii 8253	. . . . . . 7 |- 2 =/= 1
28		neeq1 2413	. . . . . . 7 |- ( x = 2 -> ( x =/= 1 <-> 2 =/= 1 ) )
29	27, 28	mpbiri 168	. . . . . 6 |- ( x = 2 -> x =/= 1 )
30		ifnefalse 3613	. . . . . 6 |- ( x =/= 1 -> if ( x = 1 , A , if ( x = 2 , B , C ) ) = if ( x = 2 , B , C ) )
31	29, 30	syl 14	. . . . 5 |- ( x = 2 -> if ( x = 1 , A , if ( x = 2 , B , C ) ) = if ( x = 2 , B , C ) )
32		iftrue 3607	. . . . 5 |- ( x = 2 -> if ( x = 2 , B , C ) = B )
33	31, 32	eqtrd 2262	. . . 4 |- ( x = 2 -> if ( x = 1 , A , if ( x = 2 , B , C ) ) = B )
34	24, 33	eqeq12d 2244	. . 3 |- ( x = 2 -> ( ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> ( F ` 2 ) = B ) )
35		fveq2 5629	. . . 4 |- ( x = 3 -> ( F ` x ) = ( F ` 3 ) )
36		1lt3 9293	. . . . . . . 8 |- 1 < 3
37	25, 36	gtneii 8253	. . . . . . 7 |- 3 =/= 1
38		neeq1 2413	. . . . . . 7 |- ( x = 3 -> ( x =/= 1 <-> 3 =/= 1 ) )
39	37, 38	mpbiri 168	. . . . . 6 |- ( x = 3 -> x =/= 1 )
40	39, 30	syl 14	. . . . 5 |- ( x = 3 -> if ( x = 1 , A , if ( x = 2 , B , C ) ) = if ( x = 2 , B , C ) )
41		2re 9191	. . . . . . . 8 |- 2 e. RR
42		2lt3 9292	. . . . . . . 8 |- 2 < 3
43	41, 42	gtneii 8253	. . . . . . 7 |- 3 =/= 2
44		neeq1 2413	. . . . . . 7 |- ( x = 3 -> ( x =/= 2 <-> 3 =/= 2 ) )
45	43, 44	mpbiri 168	. . . . . 6 |- ( x = 3 -> x =/= 2 )
46		ifnefalse 3613	. . . . . 6 |- ( x =/= 2 -> if ( x = 2 , B , C ) = C )
47	45, 46	syl 14	. . . . 5 |- ( x = 3 -> if ( x = 2 , B , C ) = C )
48	40, 47	eqtrd 2262	. . . 4 |- ( x = 3 -> if ( x = 1 , A , if ( x = 2 , B , C ) ) = C )
49	35, 48	eqeq12d 2244	. . 3 |- ( x = 3 -> ( ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> ( F ` 3 ) = C ) )
50	18, 19, 20, 23, 34, 49	raltp 3723	. 2 |- ( A. x e. { 1 , 2 , 3 } ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> ( ( F ` 1 ) = A /\ ( F ` 2 ) = B /\ ( F ` 3 ) = C ) )
51	17, 50	bitri 184	1 |- ( A. x e. ( 1 ... 3 ) ( F ` x ) = if ( x = 1 , A , if ( x = 2 , B , C ) ) <-> ( ( F ` 1 ) = A /\ ( F ` 2 ) = B /\ ( F ` 3 ) = C ) )

Syntax hints:   <-> wb 105   /\ w3a 1002   = wceq 1395   e. wcel 2200   =/= wne 2400   A.wral 2508   ifcif 3602   {ctp 3668   ` cfv 5318  (class class class)co 6007   1c1 8011   + caddc 8013   2c2 9172   3c3 9173   ZZcz 9457   ...cfz 10216

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-tp 3674  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-inn 9122  df-2 9180  df-3 9181  df-n0 9381  df-z 9458  df-uz 9734  df-fz 10217

This theorem is referenced by: (None)