Theorem opeq 4619

Description: Any class is equal to an ordered pair. (Contributed by Scott Fenton, 8-Apr-2021.)

Assertion

Ref	Expression
opeq	|- A = <. Proj1 A, Proj2 A>.

Proof of Theorem opeq

Dummy variables x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-op 4566	. 2 |- <. Proj1 A, Proj2 A>. = ({x | E.y e. Proj1 Ax = Phi y} u. {x | E.y e. Proj2 Ax = ( Phi y u. {0c})})
2		df-proj1 4567	. . . . . . 7 |- Proj1 A = {z | Phi z e. A}
3	2	rexeqi 2812	. . . . . 6 |- (E.y e. Proj1 Ax = Phi y <-> E.y e. {z | Phi z e. A}x = Phi y)
4		phieq 4570	. . . . . . . 8 |- (z = y -> Phi z = Phi y)
5	4	eleq1d 2419	. . . . . . 7 |- (z = y -> ( Phi z e. A <-> Phi y e. A))
6	5	rexab 2999	. . . . . 6 |- (E.y e. {z | Phi z e. A}x = Phi y <-> E.y( Phi y e. A /\ x = Phi y))
7		ancom 437	. . . . . . . . 9 |- (( Phi y e. A /\ x = Phi y) <-> (x = Phi y /\ Phi y e. A))
8		eleq1 2413	. . . . . . . . . 10 |- (x = Phi y -> (x e. A <-> Phi y e. A))
9	8	pm5.32i 618	. . . . . . . . 9 |- ((x = Phi y /\ x e. A) <-> (x = Phi y /\ Phi y e. A))
10	7, 9	bitr4i 243	. . . . . . . 8 |- (( Phi y e. A /\ x = Phi y) <-> (x = Phi y /\ x e. A))
11	10	exbii 1582	. . . . . . 7 |- (E.y( Phi y e. A /\ x = Phi y) <-> E.y(x = Phi y /\ x e. A))
12		19.41v 1901	. . . . . . 7 |- (E.y(x = Phi y /\ x e. A) <-> (E.y x = Phi y /\ x e. A))
13		ancom 437	. . . . . . 7 |- ((E.y x = Phi y /\ x e. A) <-> (x e. A /\ E.y x = Phi y))
14	11, 12, 13	3bitri 262	. . . . . 6 |- (E.y( Phi y e. A /\ x = Phi y) <-> (x e. A /\ E.y x = Phi y))
15	3, 6, 14	3bitri 262	. . . . 5 |- (E.y e. Proj1 Ax = Phi y <-> (x e. A /\ E.y x = Phi y))
16	15	abbii 2465	. . . 4 |- {x | E.y e. Proj1 Ax = Phi y} = {x | (x e. A /\ E.y x = Phi y)}
17		df-rab 2623	. . . 4 |- {x e. A | E.y x = Phi y} = {x | (x e. A /\ E.y x = Phi y)}
18	16, 17	eqtr4i 2376	. . 3 |- {x | E.y e. Proj1 Ax = Phi y} = {x e. A | E.y x = Phi y}
19		df-proj2 4568	. . . . . . 7 |- Proj2 A = {z | ( Phi z u. {0c}) e. A}
20	19	rexeqi 2812	. . . . . 6 |- (E.y e. Proj2 Ax = ( Phi y u. {0c}) <-> E.y e. {z | ( Phi z u. {0c}) e. A}x = ( Phi y u. {0c}))
21	4	uneq1d 3417	. . . . . . . 8 |- (z = y -> ( Phi z u. {0c}) = ( Phi y u. {0c}))
22	21	eleq1d 2419	. . . . . . 7 |- (z = y -> (( Phi z u. {0c}) e. A <-> ( Phi y u. {0c}) e. A))
23	22	rexab 2999	. . . . . 6 |- (E.y e. {z | ( Phi z u. {0c}) e. A}x = ( Phi y u. {0c}) <-> E.y(( Phi y u. {0c}) e. A /\ x = ( Phi y u. {0c})))
24		ancom 437	. . . . . . . . 9 |- ((( Phi y u. {0c}) e. A /\ x = ( Phi y u. {0c})) <-> (x = ( Phi y u. {0c}) /\ ( Phi y u. {0c}) e. A))
25		eleq1 2413	. . . . . . . . . 10 |- (x = ( Phi y u. {0c}) -> (x e. A <-> ( Phi y u. {0c}) e. A))
26	25	pm5.32i 618	. . . . . . . . 9 |- ((x = ( Phi y u. {0c}) /\ x e. A) <-> (x = ( Phi y u. {0c}) /\ ( Phi y u. {0c}) e. A))
27	24, 26	bitr4i 243	. . . . . . . 8 |- ((( Phi y u. {0c}) e. A /\ x = ( Phi y u. {0c})) <-> (x = ( Phi y u. {0c}) /\ x e. A))
28	27	exbii 1582	. . . . . . 7 |- (E.y(( Phi y u. {0c}) e. A /\ x = ( Phi y u. {0c})) <-> E.y(x = ( Phi y u. {0c}) /\ x e. A))
29		19.41v 1901	. . . . . . 7 |- (E.y(x = ( Phi y u. {0c}) /\ x e. A) <-> (E.y x = ( Phi y u. {0c}) /\ x e. A))
30		ancom 437	. . . . . . 7 |- ((E.y x = ( Phi y u. {0c}) /\ x e. A) <-> (x e. A /\ E.y x = ( Phi y u. {0c})))
31	28, 29, 30	3bitri 262	. . . . . 6 |- (E.y(( Phi y u. {0c}) e. A /\ x = ( Phi y u. {0c})) <-> (x e. A /\ E.y x = ( Phi y u. {0c})))
32	20, 23, 31	3bitri 262	. . . . 5 |- (E.y e. Proj2 Ax = ( Phi y u. {0c}) <-> (x e. A /\ E.y x = ( Phi y u. {0c})))
33	32	abbii 2465	. . . 4 |- {x | E.y e. Proj2 Ax = ( Phi y u. {0c})} = {x | (x e. A /\ E.y x = ( Phi y u. {0c}))}
34		df-rab 2623	. . . 4 |- {x e. A | E.y x = ( Phi y u. {0c})} = {x | (x e. A /\ E.y x = ( Phi y u. {0c}))}
35	33, 34	eqtr4i 2376	. . 3 |- {x | E.y e. Proj2 Ax = ( Phi y u. {0c})} = {x e. A | E.y x = ( Phi y u. {0c})}
36	18, 35	uneq12i 3416	. 2 |- ({x | E.y e. Proj1 Ax = Phi y} u. {x | E.y e. Proj2 Ax = ( Phi y u. {0c})}) = ({x e. A | E.y x = Phi y} u. {x e. A | E.y x = ( Phi y u. {0c})})
37		unrab 3526	. . 3 |- ({x e. A | E.y x = Phi y} u. {x e. A | E.y x = ( Phi y u. {0c})}) = {x e. A | (E.y x = Phi y \/ E.y x = ( Phi y u. {0c}))}
38		rabid2 2788	. . . 4 |- (A = {x e. A | (E.y x = Phi y \/ E.y x = ( Phi y u. {0c}))} <-> A.x e. A (E.y x = Phi y \/ E.y x = ( Phi y u. {0c})))
39		vex 2862	. . . . . . 7 |- x e. _V
40	39	phiall 4618	. . . . . 6 |- E.y(x = Phi y \/ x = ( Phi y u. {0c}))
41		19.43 1605	. . . . . 6 |- (E.y(x = Phi y \/ x = ( Phi y u. {0c})) <-> (E.y x = Phi y \/ E.y x = ( Phi y u. {0c})))
42	40, 41	mpbi 199	. . . . 5 |- (E.y x = Phi y \/ E.y x = ( Phi y u. {0c}))
43	42	a1i 10	. . . 4 |- (x e. A -> (E.y x = Phi y \/ E.y x = ( Phi y u. {0c})))
44	38, 43	mprgbir 2684	. . 3 |- A = {x e. A | (E.y x = Phi y \/ E.y x = ( Phi y u. {0c}))}
45	37, 44	eqtr4i 2376	. 2 |- ({x e. A | E.y x = Phi y} u. {x e. A | E.y x = ( Phi y u. {0c})}) = A
46	1, 36, 45	3eqtrri 2378	1 |- A = <. Proj1 A, Proj2 A>.

Syntax hints:   \/ wo 357   /\ wa 358  E.wex 1541   = wceq 1642   e. wcel 1710  {cab 2339  E.wrex 2615  {crab 2618   u. cun 3207  {csn 3737  0_cc0c 4374  <.cop 4561   Phi cphi 4562   Proj1 cproj1 4563   Proj2 cproj2 4564

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-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-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-rex 2620  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-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-0c 4377  df-addc 4378  df-nnc 4379  df-phi 4565  df-op 4566  df-proj1 4567  df-proj2 4568

This theorem is referenced by:  opeqexb  4620  xpvv  4843  ssrel  4844  proj1eldm  4927  co01  5093  1stfo  5505  2ndfo  5506  swapf1o  5511  otsnelsi3  5805  xpassenlem  6056  xpassen  6057  nncdiv3lem1  6275  dmfrec  6316  fnfreclem2  6318