Theorem addccan2nclem1 6263

Description: Lemma for addccan2nc 6265. Stratification helper theorem. (Contributed by Scott Fenton, 2-Aug-2019.)

Assertion

Ref	Expression
addccan2nclem1	|- (x( AddC o. `'(1st |` (_V X. {n})))y <-> y = (x +o n))

Distinct variable group:   x,n,y

Proof of Theorem addccan2nclem1

Dummy variables p q z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brco 4883	. . 3 |- (x( AddC o. `'(1st |` (_V X. {n})))y <-> E.z(x`'(1st |` (_V X. {n}))z /\ z AddC y))
2		brcnv 4892	. . . . . 6 |- (x`'(1st |` (_V X. {n}))z <-> z(1st |` (_V X. {n}))x)
3		brres 4949	. . . . . 6 |- (z(1st |` (_V X. {n}))x <-> (z1stx /\ z e. (_V X. {n})))
4		ancom 437	. . . . . . . . 9 |- ((z1stx /\ z e. (_V X. {n})) <-> (z e. (_V X. {n}) /\ z1stx))
5		elxp2 4802	. . . . . . . . . . 11 |- (z e. (_V X. {n}) <-> E.p e. _V E.q e. {n}z = <.p, q>.)
6		rexv 2873	. . . . . . . . . . 11 |- (E.p e. _V E.q e. {n}z = <.p, q>. <-> E.pE.q e. {n}z = <.p, q>.)
7		vex 2862	. . . . . . . . . . . . 13 |- n e. _V
8		opeq2 4579	. . . . . . . . . . . . . 14 |- (q = n -> <.p, q>. = <.p, n>.)
9	8	eqeq2d 2364	. . . . . . . . . . . . 13 |- (q = n -> (z = <.p, q>. <-> z = <.p, n>.))
10	7, 9	rexsn 3768	. . . . . . . . . . . 12 |- (E.q e. {n}z = <.p, q>. <-> z = <.p, n>.)
11	10	exbii 1582	. . . . . . . . . . 11 |- (E.pE.q e. {n}z = <.p, q>. <-> E.p z = <.p, n>.)
12	5, 6, 11	3bitri 262	. . . . . . . . . 10 |- (z e. (_V X. {n}) <-> E.p z = <.p, n>.)
13	12	anbi1i 676	. . . . . . . . 9 |- ((z e. (_V X. {n}) /\ z1stx) <-> (E.p z = <.p, n>. /\ z1stx))
14	4, 13	bitri 240	. . . . . . . 8 |- ((z1stx /\ z e. (_V X. {n})) <-> (E.p z = <.p, n>. /\ z1stx))
15		exancom 1586	. . . . . . . . 9 |- (E.p(z1stx /\ z = <.p, n>.) <-> E.p(z = <.p, n>. /\ z1stx))
16		19.41v 1901	. . . . . . . . 9 |- (E.p(z = <.p, n>. /\ z1stx) <-> (E.p z = <.p, n>. /\ z1stx))
17	15, 16	bitri 240	. . . . . . . 8 |- (E.p(z1stx /\ z = <.p, n>.) <-> (E.p z = <.p, n>. /\ z1stx))
18	14, 17	bitr4i 243	. . . . . . 7 |- ((z1stx /\ z e. (_V X. {n})) <-> E.p(z1stx /\ z = <.p, n>.))
19		vex 2862	. . . . . . . . . . . 12 |- x e. _V
20	19	br1st 4858	. . . . . . . . . . 11 |- (z1stx <-> E.q z = <.x, q>.)
21	20	anbi1i 676	. . . . . . . . . 10 |- ((z1stx /\ z = <.p, n>.) <-> (E.q z = <.x, q>. /\ z = <.p, n>.))
22		19.41v 1901	. . . . . . . . . 10 |- (E.q(z = <.x, q>. /\ z = <.p, n>.) <-> (E.q z = <.x, q>. /\ z = <.p, n>.))
23	21, 22	bitr4i 243	. . . . . . . . 9 |- ((z1stx /\ z = <.p, n>.) <-> E.q(z = <.x, q>. /\ z = <.p, n>.))
24	23	exbii 1582	. . . . . . . 8 |- (E.p(z1stx /\ z = <.p, n>.) <-> E.pE.q(z = <.x, q>. /\ z = <.p, n>.))
25		eqeq1 2359	. . . . . . . . . . . . 13 |- (z = <.p, n>. -> (z = <.x, q>. <-> <.p, n>. = <.x, q>.))
26		opth 4602	. . . . . . . . . . . . 13 |- (<.p, n>. = <.x, q>. <-> (p = x /\ n = q))
27	25, 26	syl6bb 252	. . . . . . . . . . . 12 |- (z = <.p, n>. -> (z = <.x, q>. <-> (p = x /\ n = q)))
28	27	pm5.32ri 619	. . . . . . . . . . 11 |- ((z = <.x, q>. /\ z = <.p, n>.) <-> ((p = x /\ n = q) /\ z = <.p, n>.))
29		equcom 1680	. . . . . . . . . . . . 13 |- (n = q <-> q = n)
30	29	anbi2i 675	. . . . . . . . . . . 12 |- ((p = x /\ n = q) <-> (p = x /\ q = n))
31	30	anbi1i 676	. . . . . . . . . . 11 |- (((p = x /\ n = q) /\ z = <.p, n>.) <-> ((p = x /\ q = n) /\ z = <.p, n>.))
32		opeq2 4579	. . . . . . . . . . . . . . 15 |- (n = q -> <.p, n>. = <.p, q>.)
33	32	equcoms 1681	. . . . . . . . . . . . . 14 |- (q = n -> <.p, n>. = <.p, q>.)
34	33	adantl 452	. . . . . . . . . . . . 13 |- ((p = x /\ q = n) -> <.p, n>. = <.p, q>.)
35	34	eqeq2d 2364	. . . . . . . . . . . 12 |- ((p = x /\ q = n) -> (z = <.p, n>. <-> z = <.p, q>.))
36	35	pm5.32i 618	. . . . . . . . . . 11 |- (((p = x /\ q = n) /\ z = <.p, n>.) <-> ((p = x /\ q = n) /\ z = <.p, q>.))
37	28, 31, 36	3bitri 262	. . . . . . . . . 10 |- ((z = <.x, q>. /\ z = <.p, n>.) <-> ((p = x /\ q = n) /\ z = <.p, q>.))
38		df-3an 936	. . . . . . . . . 10 |- ((p = x /\ q = n /\ z = <.p, q>.) <-> ((p = x /\ q = n) /\ z = <.p, q>.))
39	37, 38	bitr4i 243	. . . . . . . . 9 |- ((z = <.x, q>. /\ z = <.p, n>.) <-> (p = x /\ q = n /\ z = <.p, q>.))
40	39	2exbii 1583	. . . . . . . 8 |- (E.pE.q(z = <.x, q>. /\ z = <.p, n>.) <-> E.pE.q(p = x /\ q = n /\ z = <.p, q>.))
41	24, 40	bitri 240	. . . . . . 7 |- (E.p(z1stx /\ z = <.p, n>.) <-> E.pE.q(p = x /\ q = n /\ z = <.p, q>.))
42		opeq1 4578	. . . . . . . . 9 |- (p = x -> <.p, q>. = <.x, q>.)
43	42	eqeq2d 2364	. . . . . . . 8 |- (p = x -> (z = <.p, q>. <-> z = <.x, q>.))
44		opeq2 4579	. . . . . . . . 9 |- (q = n -> <.x, q>. = <.x, n>.)
45	44	eqeq2d 2364	. . . . . . . 8 |- (q = n -> (z = <.x, q>. <-> z = <.x, n>.))
46	19, 7, 43, 45	ceqsex2v 2896	. . . . . . 7 |- (E.pE.q(p = x /\ q = n /\ z = <.p, q>.) <-> z = <.x, n>.)
47	18, 41, 46	3bitri 262	. . . . . 6 |- ((z1stx /\ z e. (_V X. {n})) <-> z = <.x, n>.)
48	2, 3, 47	3bitri 262	. . . . 5 |- (x`'(1st |` (_V X. {n}))z <-> z = <.x, n>.)
49	48	anbi1i 676	. . . 4 |- ((x`'(1st |` (_V X. {n}))z /\ z AddC y) <-> (z = <.x, n>. /\ z AddC y))
50	49	exbii 1582	. . 3 |- (E.z(x`'(1st |` (_V X. {n}))z /\ z AddC y) <-> E.z(z = <.x, n>. /\ z AddC y))
51	19, 7	opex 4588	. . . 4 |- <.x, n>. e. _V
52		breq1 4642	. . . 4 |- (z = <.x, n>. -> (z AddC y <-> <.x, n>. AddC y))
53	51, 52	ceqsexv 2894	. . 3 |- (E.z(z = <.x, n>. /\ z AddC y) <-> <.x, n>. AddC y)
54	1, 50, 53	3bitri 262	. 2 |- (x( AddC o. `'(1st |` (_V X. {n})))y <-> <.x, n>. AddC y)
55	19, 7	braddcfn 5826	. 2 |- (<.x, n>. AddC y <-> (x +o n) = y)
56		eqcom 2355	. 2 |- ((x +o n) = y <-> y = (x +o n))
57	54, 55, 56	3bitri 262	1 |- (x( AddC o. `'(1st |` (_V X. {n})))y <-> y = (x +o n))

Syntax hints:   <-> wb 176   /\ wa 358   /\ w3a 934  E.wex 1541   = wceq 1642   e. wcel 1710  E.wrex 2615  _Vcvv 2859  {csn 3737   +o cplc 4375  <.cop 4561   class class class wbr 4639  1stc1st 4717   o. ccom 4721   X. cxp 4770  `'ccnv 4771   |` cres 4774   AddC caddcfn 5745

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4078  ax-xp 4079  ax-cnv 4080  ax-1c 4081  ax-sset 4082  ax-si 4083  ax-ins2 4084  ax-ins3 4085  ax-typlower 4086  ax-sn 4087

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-rex 2620  df-reu 2621  df-rmo 2622  df-rab 2623  df-v 2861  df-sbc 3047  df-csb 3137  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215  df-symdif 3216  df-ss 3259  df-pss 3261  df-nul 3551  df-if 3663  df-pw 3724  df-sn 3741  df-pr 3742  df-uni 3892  df-int 3927  df-iun 3971  df-opk 4058  df-1c 4136  df-pw1 4137  df-uni1 4138  df-xpk 4185  df-cnvk 4186  df-ins2k 4187  df-ins3k 4188  df-imak 4189  df-cok 4190  df-p6 4191  df-sik 4192  df-ssetk 4193  df-imagek 4194  df-idk 4195  df-iota 4339  df-0c 4377  df-addc 4378  df-nnc 4379  df-fin 4380  df-lefin 4440  df-ltfin 4441  df-ncfin 4442  df-tfin 4443  df-evenfin 4444  df-oddfin 4445  df-sfin 4446  df-spfin 4447  df-phi 4565  df-op 4566  df-proj1 4567  df-proj2 4568  df-opab 4623  df-br 4640  df-1st 4723  df-co 4726  df-ima 4727  df-id 4767  df-xp 4784  df-cnv 4785  df-rn 4786  df-dm 4787  df-res 4788  df-fun 4789  df-fn 4790  df-f 4791  df-fo 4793  df-fv 4795  df-2nd 4797  df-ov 5526  df-oprab 5528  df-mpt 5652  df-mpt2 5654  df-addcfn 5746

This theorem is referenced by:  addccan2nclem2  6264