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

Theorem opthreg 9587
Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Regularity ax-reg 9554 (via the preleq 9585 step). See df-op 4601 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 4733 . . . 4 𝐴 ∈ {𝐴, 𝐵}
3 opthreg.3 . . . . 5 𝐶 ∈ V
43prid1 4733 . . . 4 𝐶 ∈ {𝐶, 𝐷}
5 prex 5410 . . . . 5 {𝐴, 𝐵} ∈ V
65preleq 9585 . . . 4 (((𝐴 ∈ {𝐴, 𝐵} ∧ 𝐶 ∈ {𝐶, 𝐷}) ∧ {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}}) → (𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}))
72, 4, 6mpanl12 714 . . 3 ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} → (𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}))
8 preq1 4704 . . . . . 6 (𝐴 = 𝐶 → {𝐴, 𝐵} = {𝐶, 𝐵})
98eqeq1d 2771 . . . . 5 (𝐴 = 𝐶 → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ {𝐶, 𝐵} = {𝐶, 𝐷}))
10 opthreg.2 . . . . . 6 𝐵 ∈ V
11 opthreg.4 . . . . . 6 𝐷 ∈ V
1210, 11preqr2 4818 . . . . 5 ({𝐶, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷)
139, 12biimtrdi 256 . . . 4 (𝐴 = 𝐶 → ({𝐴, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷))
1413imdistani 578 . . 3 ((𝐴 = 𝐶 ∧ {𝐴, 𝐵} = {𝐶, 𝐷}) → (𝐴 = 𝐶𝐵 = 𝐷))
157, 14syl 18 . 2 ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} → (𝐴 = 𝐶𝐵 = 𝐷))
16 preq1 4704 . . . 4 (𝐴 = 𝐶 → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐴, 𝐵}})
1716adantr 485 . . 3 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐴, 𝐵}})
18 preq12 4706 . . . 4 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷})
1918preq2d 4711 . . 3 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐶, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}})
2017, 19eqtrd 2804 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}})
2115, 20impbii 212 1 ({𝐴, {𝐴, 𝐵}} = {𝐶, {𝐶, 𝐷}} ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1567  wcel 2149  Vcvv 3463  {cpr 4596
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405  ax-reg 9554
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-eprel 5562  df-fr 5615
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator