Theorem copsex4g 4610

Description: An implicit substitution inference for 2 ordered pairs. (Contributed by NM, 5-Aug-1995.)

Hypothesis

Ref	Expression
copsex4g.1	|- (((x = A /\ y = B) /\ (z = C /\ w = D)) -> (ph <-> ps))

Assertion

Ref	Expression
copsex4g	|- (((A e. R /\ B e. S) /\ (C e. R /\ D e. S)) -> (E.xE.yE.zE.w((<.A, B>. = <.x, y>. /\ <.C, D>. = <.z, w>.) /\ ph) <-> ps))

Distinct variable groups:   x,y,z,w,A   x,B,y,z,w   x,C,y,z,w   x,D,y,z,w   ps,x,y,z,w   x,R,y,z,w   x,S,y,z,w

Allowed substitution hints:   ph(x,y,z,w)

Proof of Theorem copsex4g

Step	Hyp	Ref	Expression
1		eqcom 2355	. . . . . . 7 |- (<.A, B>. = <.x, y>. <-> <.x, y>. = <.A, B>.)
2		opth 4602	. . . . . . 7 |- (<.x, y>. = <.A, B>. <-> (x = A /\ y = B))
3	1, 2	bitri 240	. . . . . 6 |- (<.A, B>. = <.x, y>. <-> (x = A /\ y = B))
4		eqcom 2355	. . . . . . 7 |- (<.C, D>. = <.z, w>. <-> <.z, w>. = <.C, D>.)
5		opth 4602	. . . . . . 7 |- (<.z, w>. = <.C, D>. <-> (z = C /\ w = D))
6	4, 5	bitri 240	. . . . . 6 |- (<.C, D>. = <.z, w>. <-> (z = C /\ w = D))
7	3, 6	anbi12i 678	. . . . 5 |- ((<.A, B>. = <.x, y>. /\ <.C, D>. = <.z, w>.) <-> ((x = A /\ y = B) /\ (z = C /\ w = D)))
8	7	anbi1i 676	. . . 4 |- (((<.A, B>. = <.x, y>. /\ <.C, D>. = <.z, w>.) /\ ph) <-> (((x = A /\ y = B) /\ (z = C /\ w = D)) /\ ph))
9	8	2exbii 1583	. . 3 |- (E.zE.w((<.A, B>. = <.x, y>. /\ <.C, D>. = <.z, w>.) /\ ph) <-> E.zE.w(((x = A /\ y = B) /\ (z = C /\ w = D)) /\ ph))
10	9	2exbii 1583	. 2 |- (E.xE.yE.zE.w((<.A, B>. = <.x, y>. /\ <.C, D>. = <.z, w>.) /\ ph) <-> E.xE.yE.zE.w(((x = A /\ y = B) /\ (z = C /\ w = D)) /\ ph))
11		id 19	. . 3 |- (((x = A /\ y = B) /\ (z = C /\ w = D)) -> ((x = A /\ y = B) /\ (z = C /\ w = D)))
12		copsex4g.1	. . 3 |- (((x = A /\ y = B) /\ (z = C /\ w = D)) -> (ph <-> ps))
13	11, 12	cgsex4g 2892	. 2 |- (((A e. R /\ B e. S) /\ (C e. R /\ D e. S)) -> (E.xE.yE.zE.w(((x = A /\ y = B) /\ (z = C /\ w = D)) /\ ph) <-> ps))
14	10, 13	syl5bb 248	1 |- (((A e. R /\ B e. S) /\ (C e. R /\ D e. S)) -> (E.xE.yE.zE.w((<.A, B>. = <.x, y>. /\ <.C, D>. = <.z, w>.) /\ ph) <-> ps))

Syntax hints:   -> wi 4   <-> wb 176   /\ wa 358  E.wex 1541   = wceq 1642   e. wcel 1710  <.cop 4561

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-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-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

This theorem is referenced by:  opbrop  4841  ov3  5599