Theorem opthreg 8036

Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Regularity ax-reg 8019 (via the preleq 8035 step). See df-op 4034 for a description of other ordered pair representations. Exercise 34 of [Enderton] p. 207. (Contributed by NM, 16-Oct-1996.)

Hypotheses

Ref	Expression
preleq.1	|- A e. _V
preleq.2	|- B e. _V
preleq.3	|- C e. _V
preleq.4	|- D e. _V

Assertion

Ref	Expression
opthreg	|- ( { A , { A , B } } = { C , { C , D } } <-> ( A = C /\ B = D ) )

Proof of Theorem opthreg

Step	Hyp	Ref	Expression
1		preleq.1	. . . . 5 |- A e. _V
2	1	prid1 4135	. . . 4 |- A e. { A , B }
3		preleq.3	. . . . 5 |- C e. _V
4	3	prid1 4135	. . . 4 |- C e. { C , D }
5		prex 4689	. . . . 5 |- { A , B } e. _V
6		prex 4689	. . . . 5 |- { C , D } e. _V
7	1, 5, 3, 6	preleq 8035	. . . 4 |- ( ( ( A e. { A , B } /\ C e. { C , D } ) /\ { A , { A , B } } = { C , { C , D } } ) -> ( A = C /\ { A , B } = { C , D } ) )
8	2, 4, 7	mpanl12 682	. . 3 |- ( { A , { A , B } } = { C , { C , D } } -> ( A = C /\ { A , B } = { C , D } ) )
9		preq1 4106	. . . . . 6 |- ( A = C -> { A , B } = { C , B } )
10	9	eqeq1d 2469	. . . . 5 |- ( A = C -> ( { A , B } = { C , D } <-> { C , B } = { C , D } ) )
11		preleq.2	. . . . . 6 |- B e. _V
12		preleq.4	. . . . . 6 |- D e. _V
13	11, 12	preqr2 4201	. . . . 5 |- ( { C , B } = { C , D } -> B = D )
14	10, 13	syl6bi 228	. . . 4 |- ( A = C -> ( { A , B } = { C , D } -> B = D ) )
15	14	imdistani 690	. . 3 |- ( ( A = C /\ { A , B } = { C , D } ) -> ( A = C /\ B = D ) )
16	8, 15	syl 16	. 2 |- ( { A , { A , B } } = { C , { C , D } } -> ( A = C /\ B = D ) )
17		preq1 4106	. . . 4 |- ( A = C -> { A , { A , B } } = { C , { A , B } } )
18	17	adantr 465	. . 3 |- ( ( A = C /\ B = D ) -> { A , { A , B } } = { C , { A , B } } )
19		preq12 4108	. . . 4 |- ( ( A = C /\ B = D ) -> { A , B } = { C , D } )
20	19	preq2d 4113	. . 3 |- ( ( A = C /\ B = D ) -> { C , { A , B } } = { C , { C , D } } )
21	18, 20	eqtrd 2508	. 2 |- ( ( A = C /\ B = D ) -> { A , { A , B } } = { C , { C , D } } )
22	16, 21	impbii 188	1 |- ( { A , { A , B } } = { C , { C , D } } <-> ( A = C /\ B = D ) )

Syntax hints:   <-> wb 184   /\ wa 369   = wceq 1379   e. wcel 1767   _Vcvv 3113   {cpr 4029

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pr 4686  ax-reg 8019

This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-br 4448  df-opab 4506  df-eprel 4791  df-fr 4838

This theorem is referenced by: (None)