HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem opth2 1909
Description: Equality of the second members of equal ordered pairs. Because of our particular ordered pair definition, equality holds whether or not the first members are sets.
Hypotheses
Ref Expression
opth2.1 BV
opth2.2 DV
Assertion
Ref Expression
opth2 (⟨A, B⟩ = ⟨C, D⟩ → B = D)

Proof of Theorem opth2
StepHypRef Expression
1 opeq1 1876 . . . . 5 (x = A → ⟨x, B⟩ = ⟨A, B⟩)
21cleq1d 1109 . . . 4 (x = A → (⟨x, B⟩ = ⟨C, D⟩ ↔ ⟨A, B⟩ = ⟨C, D⟩))
32imbi1d 465 . . 3 (x = A → ((⟨x, B⟩ = ⟨C, D⟩ → B = D) ↔ (⟨A, B⟩ = ⟨C, D⟩ → B = D)))
4 visset 1350 . . . . 5 xV
5 opth2.1 . . . . 5 BV
6 opth2.2 . . . . 5 DV
74, 5, 6opth 1898 . . . 4 (⟨x, B⟩ = ⟨C, D⟩ ↔ (x = CB = D))
87pm3.27bd 263 . . 3 (⟨x, B⟩ = ⟨C, D⟩ → B = D)
93, 8vtoclg 1383 . 2 (AV → (⟨A, B⟩ = ⟨C, D⟩ → B = D))
10 clneq2 1169 . . . . 5 ((∅ ∈ ⟨A, B⟩ ∧ ¬ ∅ ∈ ⟨C, D⟩) → ¬ ⟨A, B⟩ = ⟨C, D⟩)
11 opprc1b 1906 . . . . 5 AV ↔ ∅ ∈ ⟨A, B⟩)
12 opprc1b 1906 . . . . . . 7 CV ↔ ∅ ∈ ⟨C, D⟩)
1312bicon1i 193 . . . . . 6 (¬ ∅ ∈ ⟨C, D⟩ ↔ CV)
1413bicomi 150 . . . . 5 (CV ↔ ¬ ∅ ∈ ⟨C, D⟩)
1510, 11, 14syl2anb 350 . . . 4 ((¬ AVCV) → ¬ ⟨A, B⟩ = ⟨C, D⟩)
1615pm2.21d 74 . . 3 ((¬ AVCV) → (⟨A, B⟩ = ⟨C, D⟩ → B = D))
17 opprc1 1905 . . . . 5 AV → ⟨A, B⟩ = {∅, {B}})
18 opprc1 1905 . . . . 5 CV → ⟨C, D⟩ = {∅, {D}})
1917, 18cleqan12d 1116 . . . 4 ((¬ AV ∧ ¬ CV) → (⟨A, B⟩ = ⟨C, D⟩ ↔ {∅, {B}} = {∅, {D}}))
20 snex 1859 . . . . . 6 {B} ∈ V
21 snex 1859 . . . . . 6 {D} ∈ V
2220, 21prer2 1873 . . . . 5 ({∅, {B}} = {∅, {D}} → {B} = {D})
235sneqr 1856 . . . . 5 ({B} = {D} → B = D)
2422, 23syl 12 . . . 4 ({∅, {B}} = {∅, {D}} → B = D)
2519, 24syl6bi 187 . . 3 ((¬ AV ∧ ¬ CV) → (⟨A, B⟩ = ⟨C, D⟩ → B = D))
2616, 25pm2.61an2 365 . 2 AV → (⟨A, B⟩ = ⟨C, D⟩ → B = D))
279, 26pm2.61i 110 1 (⟨A, B⟩ = ⟨C, D⟩ → B = D)
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ∧ wa 196   = wceq 1091   ∈ wcel 1092  Vcvv 1348  ∅c0 1707  {csn 1808  {cpr 1809  ⟨cop 1810
This theorem is referenced by:  moop2 1910
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815
metamath.org