Theorem nninfwlporlemd 7172

Description: Given two countably infinite sequences of zeroes and ones, they are equal if and only if a sequence formed by pointwise comparing them is all ones. (Contributed by Jim Kingdon, 6-Dec-2024.)

Hypotheses

Ref	Expression
nninfwlporlem.x	|- ( ph -> X : om --> 2o )
nninfwlporlem.y	|- ( ph -> Y : om --> 2o )
nninfwlporlem.d	|- D = ( i e. om |-> if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) )

Assertion

Ref	Expression
nninfwlporlemd	|- ( ph -> ( X = Y <-> D = ( i e. om |-> 1o ) ) )

Distinct variable groups:   D, i   i, X   i, Y   ph, i

Proof of Theorem nninfwlporlemd

Dummy variable j is distinct from all other variables.

Step	Hyp	Ref	Expression
1		1n0 6435	. . . . . . . . 9 |- 1o =/= (/)
2	1	neii 2349	. . . . . . . 8 |- -. 1o = (/)
3	2	intnan 929	. . . . . . 7 |- -. ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) )
4	3	biorfi 746	. . . . . 6 |- ( ( X ` i ) = ( Y ` i ) <-> ( ( X ` i ) = ( Y ` i ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) )
5		eqid 2177	. . . . . . . 8 |- 1o = 1o
6	5	biantru 302	. . . . . . 7 |- ( ( X ` i ) = ( Y ` i ) <-> ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) )
7	6	orbi1i 763	. . . . . 6 |- ( ( ( X ` i ) = ( Y ` i ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) <-> ( ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) )
8	4, 7	bitri 184	. . . . 5 |- ( ( X ` i ) = ( Y ` i ) <-> ( ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) )
9		eqcom 2179	. . . . . 6 |- ( 1o = ( D ` i ) <-> ( D ` i ) = 1o )
10		nninfwlporlem.d	. . . . . . . . . 10 |- D = ( i e. om |-> if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) )
11		fveq2 5517	. . . . . . . . . . . . 13 |- ( i = j -> ( X ` i ) = ( X ` j ) )
12		fveq2 5517	. . . . . . . . . . . . 13 |- ( i = j -> ( Y ` i ) = ( Y ` j ) )
13	11, 12	eqeq12d 2192	. . . . . . . . . . . 12 |- ( i = j -> ( ( X ` i ) = ( Y ` i ) <-> ( X ` j ) = ( Y ` j ) ) )
14	13	ifbid 3557	. . . . . . . . . . 11 |- ( i = j -> if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) = if ( ( X ` j ) = ( Y ` j ) , 1o , (/) ) )
15	14	cbvmptv 4101	. . . . . . . . . 10 |- ( i e. om |-> if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) ) = ( j e. om |-> if ( ( X ` j ) = ( Y ` j ) , 1o , (/) ) )
16	10, 15	eqtri 2198	. . . . . . . . 9 |- D = ( j e. om |-> if ( ( X ` j ) = ( Y ` j ) , 1o , (/) ) )
17		fveq2 5517	. . . . . . . . . . 11 |- ( j = i -> ( X ` j ) = ( X ` i ) )
18		fveq2 5517	. . . . . . . . . . 11 |- ( j = i -> ( Y ` j ) = ( Y ` i ) )
19	17, 18	eqeq12d 2192	. . . . . . . . . 10 |- ( j = i -> ( ( X ` j ) = ( Y ` j ) <-> ( X ` i ) = ( Y ` i ) ) )
20	19	ifbid 3557	. . . . . . . . 9 |- ( j = i -> if ( ( X ` j ) = ( Y ` j ) , 1o , (/) ) = if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) )
21		simpr 110	. . . . . . . . 9 |- ( ( ph /\ i e. om ) -> i e. om )
22		1lt2o 6445	. . . . . . . . . . 11 |- 1o e. 2o
23	22	a1i 9	. . . . . . . . . 10 |- ( ( ph /\ i e. om ) -> 1o e. 2o )
24		0lt2o 6444	. . . . . . . . . . 11 |- (/) e. 2o
25	24	a1i 9	. . . . . . . . . 10 |- ( ( ph /\ i e. om ) -> (/) e. 2o )
26		2ssom 6527	. . . . . . . . . . . 12 |- 2o C_ om
27		nninfwlporlem.x	. . . . . . . . . . . . 13 |- ( ph -> X : om --> 2o )
28	27	ffvelcdmda 5653	. . . . . . . . . . . 12 |- ( ( ph /\ i e. om ) -> ( X ` i ) e. 2o )
29	26, 28	sselid 3155	. . . . . . . . . . 11 |- ( ( ph /\ i e. om ) -> ( X ` i ) e. om )
30		nninfwlporlem.y	. . . . . . . . . . . . 13 |- ( ph -> Y : om --> 2o )
31	30	ffvelcdmda 5653	. . . . . . . . . . . 12 |- ( ( ph /\ i e. om ) -> ( Y ` i ) e. 2o )
32	26, 31	sselid 3155	. . . . . . . . . . 11 |- ( ( ph /\ i e. om ) -> ( Y ` i ) e. om )
33		nndceq 6502	. . . . . . . . . . 11 |- ( ( ( X ` i ) e. om /\ ( Y ` i ) e. om ) -> DECID ( X ` i ) = ( Y ` i ) )
34	29, 32, 33	syl2anc 411	. . . . . . . . . 10 |- ( ( ph /\ i e. om ) -> DECID ( X ` i ) = ( Y ` i ) )
35	23, 25, 34	ifcldcd 3572	. . . . . . . . 9 |- ( ( ph /\ i e. om ) -> if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) e. 2o )
36	16, 20, 21, 35	fvmptd3 5611	. . . . . . . 8 |- ( ( ph /\ i e. om ) -> ( D ` i ) = if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) )
37	36	eqeq2d 2189	. . . . . . 7 |- ( ( ph /\ i e. om ) -> ( 1o = ( D ` i ) <-> 1o = if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) ) )
38		eqifdc 3571	. . . . . . . 8 |- (DECID ( X ` i ) = ( Y ` i ) -> ( 1o = if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) <-> ( ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) ) )
39	34, 38	syl 14	. . . . . . 7 |- ( ( ph /\ i e. om ) -> ( 1o = if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) <-> ( ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) ) )
40	37, 39	bitrd 188	. . . . . 6 |- ( ( ph /\ i e. om ) -> ( 1o = ( D ` i ) <-> ( ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) ) )
41	9, 40	bitr3id 194	. . . . 5 |- ( ( ph /\ i e. om ) -> ( ( D ` i ) = 1o <-> ( ( ( X ` i ) = ( Y ` i ) /\ 1o = 1o ) \/ ( -. ( X ` i ) = ( Y ` i ) /\ 1o = (/) ) ) ) )
42	8, 41	bitr4id 199	. . . 4 |- ( ( ph /\ i e. om ) -> ( ( X ` i ) = ( Y ` i ) <-> ( D ` i ) = 1o ) )
43	42	ralbidva 2473	. . 3 |- ( ph -> ( A. i e. om ( X ` i ) = ( Y ` i ) <-> A. i e. om ( D ` i ) = 1o ) )
44		fveqeq2 5526	. . . 4 |- ( i = j -> ( ( D ` i ) = 1o <-> ( D ` j ) = 1o ) )
45	44	cbvralv 2705	. . 3 |- ( A. i e. om ( D ` i ) = 1o <-> A. j e. om ( D ` j ) = 1o )
46	43, 45	bitrdi 196	. 2 |- ( ph -> ( A. i e. om ( X ` i ) = ( Y ` i ) <-> A. j e. om ( D ` j ) = 1o ) )
47	27	ffnd 5368	. . 3 |- ( ph -> X Fn om )
48	30	ffnd 5368	. . 3 |- ( ph -> Y Fn om )
49		eqfnfv 5615	. . 3 |- ( ( X Fn om /\ Y Fn om ) -> ( X = Y <-> A. i e. om ( X ` i ) = ( Y ` i ) ) )
50	47, 48, 49	syl2anc 411	. 2 |- ( ph -> ( X = Y <-> A. i e. om ( X ` i ) = ( Y ` i ) ) )
51	35	ralrimiva 2550	. . . 4 |- ( ph -> A. i e. om if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) e. 2o )
52	10	fnmpt 5344	. . . 4 |- ( A. i e. om if ( ( X ` i ) = ( Y ` i ) , 1o , (/) ) e. 2o -> D Fn om )
53	51, 52	syl 14	. . 3 |- ( ph -> D Fn om )
54		eqidd 2178	. . 3 |- ( j = i -> 1o = 1o )
55		1onn 6523	. . . 4 |- 1o e. om
56	55	a1i 9	. . 3 |- ( ( ph /\ j e. om ) -> 1o e. om )
57	55	a1i 9	. . 3 |- ( ( ph /\ i e. om ) -> 1o e. om )
58	53, 54, 56, 57	fnmptfvd 5622	. 2 |- ( ph -> ( D = ( i e. om |-> 1o ) <-> A. j e. om ( D ` j ) = 1o ) )
59	46, 50, 58	3bitr4d 220	1 |- ( ph -> ( X = Y <-> D = ( i e. om |-> 1o ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 708  DECID wdc 834   = wceq 1353   e. wcel 2148   A.wral 2455   (/)c0 3424   ifcif 3536   |-> cmpt 4066   omcom 4591   Fn wfn 5213   -->wf 5214   ` cfv 5218   1oc1o 6412   2oc2o 6413

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 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  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-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-if 3537  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226  df-1o 6419  df-2o 6420

This theorem is referenced by:  nninfwlporlem  7173