Theorem opthreg 4466

Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Set Induction ax-setind 4447 (via the preleq 4465 step). See df-op 3531 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 3624	. . . 4 |- A e. { A , B }
3		preleq.3	. . . . 5 |- C e. _V
4	3	prid1 3624	. . . 4 |- C e. { C , D }
5		preleq.2	. . . . . 6 |- B e. _V
6		prexg 4128	. . . . . 6 |- ( ( A e. _V /\ B e. _V ) -> { A , B } e. _V )
7	1, 5, 6	mp2an 422	. . . . 5 |- { A , B } e. _V
8		preleq.4	. . . . . 6 |- D e. _V
9		prexg 4128	. . . . . 6 |- ( ( C e. _V /\ D e. _V ) -> { C , D } e. _V )
10	3, 8, 9	mp2an 422	. . . . 5 |- { C , D } e. _V
11	1, 7, 3, 10	preleq 4465	. . . 4 |- ( ( ( A e. { A , B } /\ C e. { C , D } ) /\ { A , { A , B } } = { C , { C , D } } ) -> ( A = C /\ { A , B } = { C , D } ) )
12	2, 4, 11	mpanl12 432	. . 3 |- ( { A , { A , B } } = { C , { C , D } } -> ( A = C /\ { A , B } = { C , D } ) )
13		preq1 3595	. . . . . 6 |- ( A = C -> { A , B } = { C , B } )
14	13	eqeq1d 2146	. . . . 5 |- ( A = C -> ( { A , B } = { C , D } <-> { C , B } = { C , D } ) )
15	5, 8	preqr2 3691	. . . . 5 |- ( { C , B } = { C , D } -> B = D )
16	14, 15	syl6bi 162	. . . 4 |- ( A = C -> ( { A , B } = { C , D } -> B = D ) )
17	16	imdistani 441	. . 3 |- ( ( A = C /\ { A , B } = { C , D } ) -> ( A = C /\ B = D ) )
18	12, 17	syl 14	. 2 |- ( { A , { A , B } } = { C , { C , D } } -> ( A = C /\ B = D ) )
19		preq1 3595	. . . 4 |- ( A = C -> { A , { A , B } } = { C , { A , B } } )
20	19	adantr 274	. . 3 |- ( ( A = C /\ B = D ) -> { A , { A , B } } = { C , { A , B } } )
21		preq12 3597	. . . 4 |- ( ( A = C /\ B = D ) -> { A , B } = { C , D } )
22	21	preq2d 3602	. . 3 |- ( ( A = C /\ B = D ) -> { C , { A , B } } = { C , { C , D } } )
23	20, 22	eqtrd 2170	. 2 |- ( ( A = C /\ B = D ) -> { A , { A , B } } = { C , { C , D } } )
24	18, 23	impbii 125	1 |- ( { A , { A , B } } = { C , { C , D } } <-> ( A = C /\ B = D ) )

Syntax hints:   /\ wa 103   <-> wb 104   = wceq 1331   e. wcel 1480   _Vcvv 2681   {cpr 3523

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pr 4126  ax-setind 4447

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-dif 3068  df-un 3070  df-sn 3528  df-pr 3529

This theorem is referenced by: (None)