MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opthreg Structured version   Visualization version   GIF version

Theorem opthreg 9376
Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Regularity ax-reg 9351 (via the preleq 9374 step). See df-op 4568 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
StepHypRef Expression
1 opthreg.1 . . . . 5 𝐴 ∈ V
21prid1 4698 . . . 4 𝐴 ∈ {𝐴, 𝐵}
3 opthreg.3 . . . . 5 𝐶 ∈ V
43prid1 4698 . . . 4 𝐶 ∈ {𝐶, 𝐷}
5 prex 5355 . . . . 5 {𝐴, 𝐵} ∈ V
65preleq 9374 . . . 4 (((𝐴 ∈ {𝐴, 𝐵} ∧ 𝐶 ∈ {𝐶, 𝐷}) ∧ {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}}) → (𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}))
72, 4, 6mpanl12 699 . . 3 ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} → (𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}))
8 preq1 4669 . . . . . 6 (𝐴 = 𝐶 → {𝐴, 𝐵} = {𝐶, 𝐵})
98eqeq1d 2740 . . . . 5 (𝐴 = 𝐶 → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ {𝐶, 𝐵} = {𝐶, 𝐷}))
10 opthreg.2 . . . . . 6 𝐵 ∈ V
11 opthreg.4 . . . . . 6 𝐷 ∈ V
1210, 11preqr2 4780 . . . . 5 ({𝐶, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷)
139, 12syl6bi 252 . . . 4 (𝐴 = 𝐶 → ({𝐴, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷))
1413imdistani 569 . . 3 ((𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶𝐵 = 𝐷))
157, 14syl 17 . 2 ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} → (𝐴 = 𝐶𝐵 = 𝐷))
16 preq1 4669 . . . 4 (𝐴 = 𝐶 → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐴, 𝐵}})
1716adantr 481 . . 3 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐴, 𝐵}})
18 preq12 4671 . . . 4 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷})
1918preq2d 4676 . . 3 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐶, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}})
2017, 19eqtrd 2778 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}})
2115, 20impbii 208 1 ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1539  wcel 2106  Vcvv 3432  {cpr 4563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-reg 9351
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-eprel 5495  df-fr 5544
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator