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

Theorem elopg 4964
Description: Characterization of the elements of an ordered pair. Closed form of elop 4965. (Contributed by BJ, 22-Jun-2019.) (Avoid depending on this detail.)
Assertion
Ref Expression
elopg ((𝐴𝑉𝐵𝑊) → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵})))

Proof of Theorem elopg
StepHypRef Expression
1 dfopg 4431 . 2 ((𝐴𝑉𝐵𝑊) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
2 eleq2 2719 . . 3 (⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}} → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ 𝐶 ∈ {{𝐴}, {𝐴, 𝐵}}))
3 snex 4938 . . . 4 {𝐴} ∈ V
4 prex 4939 . . . 4 {𝐴, 𝐵} ∈ V
53, 4elpr2 4232 . . 3 (𝐶 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵}))
62, 5syl6bb 276 . 2 (⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}} → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵})))
71, 6syl 17 1 ((𝐴𝑉𝐵𝑊) → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wo 382  wa 383   = wceq 1523  wcel 2030  {csn 4210  {cpr 4212  cop 4216
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217
This theorem is referenced by:  elop  4965  bj-inftyexpidisj  33227
  Copyright terms: Public domain W3C validator