Theorem opthreg 9594

Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Regularity ax-reg 9561 (via the preleq 9592 step). See df-op 4598 for a description of other ordered pair representations. Exercise 34 of [Enderton] p. 207. (Contributed by NM, 16-Oct-1996.) (Proof shortened by AV, 15-Jun-2022.)

Hypotheses

Ref	Expression
opthreg.1	⊢ 𝐴 ∈ V
opthreg.2	⊢ 𝐵 ∈ V
opthreg.3	⊢ 𝐶 ∈ V
opthreg.4	⊢ 𝐷 ∈ V

Assertion

Ref	Expression
opthreg	⊢ ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

Proof of Theorem opthreg

Step	Hyp	Ref	Expression
1		opthreg.1	. . . . 5 ⊢ 𝐴 ∈ V
2	1	prid1 4730	. . . 4 ⊢ 𝐴 ∈ {𝐴, 𝐵}
3		opthreg.3	. . . . 5 ⊢ 𝐶 ∈ V
4	3	prid1 4730	. . . 4 ⊢ 𝐶 ∈ {𝐶, 𝐷}
5		prex 5411	. . . . 5 ⊢ {𝐴, 𝐵} ∈ V
6	5	preleq 9592	. . . 4 ⊢ (((𝐴 ∈ {𝐴, 𝐵} ∧ 𝐶 ∈ {𝐶, 𝐷}) ∧ {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}}) → (𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}))
7	2, 4, 6	mpanl12 715	. . 3 ⊢ ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} → (𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}))
8		preq1 4701	. . . . . 6 ⊢ (𝐴 = 𝐶 → {𝐴, 𝐵} = {𝐶, 𝐵})
9	8	eqeq1d 2767	. . . . 5 ⊢ (𝐴 = 𝐶 → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ {𝐶, 𝐵} = {𝐶, 𝐷}))
10		opthreg.2	. . . . . 6 ⊢ 𝐵 ∈ V
11		opthreg.4	. . . . . 6 ⊢ 𝐷 ∈ V
12	10, 11	preqr2 4816	. . . . 5 ⊢ ({𝐶, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷)
13	9, 12	biimtrdi 256	. . . 4 ⊢ (𝐴 = 𝐶 → ({𝐴, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷))
14	13	imdistani 579	. . 3 ⊢ ((𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
15	7, 14	syl 18	. 2 ⊢ ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
16		preq1 4701	. . . 4 ⊢ (𝐴 = 𝐶 → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐴, 𝐵}})
17	16	adantr 486	. . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐴, 𝐵}})
18		preq12 4703	. . . 4 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷})
19	18	preq2d 4708	. . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐶, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}})
20	17, 19	eqtrd 2800	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}})
21	15, 20	impbii 212	1 ⊢ ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457  {cpr 4593

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406  ax-reg 9561

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-eprel 5563  df-fr 5616

This theorem is used by: (None)