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

Theorem opth1 5444
Description: Equality of the first members of equal ordered pairs. (Contributed by NM, 28-May-2008.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
opth1.1 𝐴 ∈ V
opth1.2 𝐵 ∈ V
Assertion
Ref Expression
opth1 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → 𝐴 = 𝐶)

Proof of Theorem opth1
StepHypRef Expression
1 opth1.1 . . . 4 𝐴 ∈ V
2 opth1.2 . . . 4 𝐵 ∈ V
31, 2opi1 5437 . . 3 {𝐴} ∈ ⟨𝐴, 𝐵⟩
4 id 23 . . 3 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩)
53, 4eleqtrid 2867 . 2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → {𝐴} ∈ ⟨𝐶, 𝐷⟩)
61sneqr 4800 . . . 4 ({𝐴} = {𝐶} → 𝐴 = 𝐶)
76a1i 11 . . 3 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → ({𝐴} = {𝐶} → 𝐴 = 𝐶))
8 oprcl 4859 . . . . . . 7 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → (𝐶 ∈ V ∧ 𝐷 ∈ V))
98simpld 500 . . . . . 6 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → 𝐶 ∈ V)
10 prid1g 4721 . . . . . 6 (𝐶 ∈ V → 𝐶 ∈ {𝐶, 𝐷})
119, 10syl 18 . . . . 5 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → 𝐶 ∈ {𝐶, 𝐷})
12 eleq2 2850 . . . . 5 ({𝐴} = {𝐶, 𝐷} → (𝐶 ∈ {𝐴} ↔ 𝐶 ∈ {𝐶, 𝐷}))
1311, 12syl5ibrcom 250 . . . 4 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → ({𝐴} = {𝐶, 𝐷} → 𝐶 ∈ {𝐴}))
14 elsni 4601 . . . . 5 (𝐶 ∈ {𝐴} → 𝐶 = 𝐴)
1514eqcomd 2767 . . . 4 (𝐶 ∈ {𝐴} → 𝐴 = 𝐶)
1613, 15syl6 36 . . 3 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → ({𝐴} = {𝐶, 𝐷} → 𝐴 = 𝐶))
17 id 23 . . . . 5 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → {𝐴} ∈ ⟨𝐶, 𝐷⟩)
18 dfopg 4831 . . . . . 6 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → ⟨𝐶, 𝐷⟩ = {{𝐶}, {𝐶, 𝐷}})
198, 18syl 18 . . . . 5 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → ⟨𝐶, 𝐷⟩ = {{𝐶}, {𝐶, 𝐷}})
2017, 19eleqtrd 2863 . . . 4 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → {𝐴} ∈ {{𝐶}, {𝐶, 𝐷}})
21 elpri 4608 . . . 4 ({𝐴} ∈ {{𝐶}, {𝐶, 𝐷}} → ({𝐴} = {𝐶} ∨ {𝐴} = {𝐶, 𝐷}))
2220, 21syl 18 . . 3 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → ({𝐴} = {𝐶} ∨ {𝐴} = {𝐶, 𝐷}))
237, 16, 22mpjaod 874 . 2 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → 𝐴 = 𝐶)
245, 23syl 18 1 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → 𝐴 = 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584  {cpr 4586  ⟨cop 4590
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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591
This theorem is used by:  opth  5445  dmsnopg  6214  funcnvsn  6590  oprabidw  7451  oprabid  7452  seqomlem2  8461  unxpdomlem3  9249  dfac5lem4  10205  dcomex  10525  canthwelem  10735  uzrdgfni  14101  fnpr2ob  17730  gsum2d2  20188  noseqrdgfn  28692  soinfdom  35717  poimirlem9  38547  ichnreuop  48553  ichreuopeq  48554  diag1f1lem  50413  idfudiag1bas  50631
  Copyright terms: Public domain W3C validator