Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfopg GIF version

Theorem dfopg 3698
 Description: Value of the ordered pair when the arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
dfopg ((𝐴𝑉𝐵𝑊) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})

Proof of Theorem dfopg
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elex 2692 . 2 (𝐴𝑉𝐴 ∈ V)
2 elex 2692 . 2 (𝐵𝑊𝐵 ∈ V)
3 df-3an 964 . . . . . 6 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
43baibr 905 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})))
54abbidv 2255 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})})
6 abid2 2258 . . . 4 {𝑥𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {{𝐴}, {𝐴, 𝐵}}
7 df-op 3531 . . . . 5 𝐴, 𝐵⟩ = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}
87eqcomi 2141 . . . 4 {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ⟨𝐴, 𝐵
95, 6, 83eqtr3g 2193 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} = ⟨𝐴, 𝐵⟩)
109eqcomd 2143 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
111, 2, 10syl2an 287 1 ((𝐴𝑉𝐵𝑊) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 962   = wceq 1331   ∈ wcel 1480  {cab 2123  Vcvv 2681  {csn 3522  {cpr 3523  ⟨cop 3525 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-11 1484  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119 This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-v 2683  df-op 3531 This theorem is referenced by:  dfop  3699  opexg  4145  opth1  4153  opth  4154  0nelop  4165  op1stbg  4395
 Copyright terms: Public domain W3C validator