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

Theorem elop 5350
Description: Characterization of the elements of an ordered pair. Exercise 3 of [TakeutiZaring] p. 15. (Contributed by NM, 15-Jul-1993.) (Revised by Mario Carneiro, 26-Apr-2015.) Remove an extraneous hypothesis. (Revised by BJ, 25-Dec-2020.) (Avoid depending on this detail.)
Hypotheses
Ref Expression
elop.1 𝐵 ∈ V
elop.2 𝐶 ∈ V
Assertion
Ref Expression
elop (𝐴 ∈ ⟨𝐵, 𝐶⟩ ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶}))

Proof of Theorem elop
StepHypRef Expression
1 elop.1 . 2 𝐵 ∈ V
2 elop.2 . 2 𝐶 ∈ V
3 elopg 5349 . 2 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ∈ ⟨𝐵, 𝐶⟩ ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶})))
41, 2, 3mp2an 688 1 (𝐴 ∈ ⟨𝐵, 𝐶⟩ ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶}))
Colors of variables: wff setvar class
Syntax hints:  wb 207  wo 841   = wceq 1528  wcel 2105  Vcvv 3492  {csn 4557  {cpr 4559  cop 4563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-v 3494  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564
This theorem is referenced by:  relop  5714
  Copyright terms: Public domain W3C validator