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

Theorem dfopg 3790
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 2762 . 2 (𝐴𝑉𝐴 ∈ V)
2 elex 2762 . 2 (𝐵𝑊𝐵 ∈ V)
3 df-3an 981 . . . . . 6 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
43baibr 921 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})))
54abbidv 2306 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})})
6 abid2 2309 . . . 4 {𝑥𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {{𝐴}, {𝐴, 𝐵}}
7 df-op 3615 . . . . 5 𝐴, 𝐵⟩ = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}
87eqcomi 2192 . . . 4 {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ⟨𝐴, 𝐵
95, 6, 83eqtr3g 2244 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} = ⟨𝐴, 𝐵⟩)
109eqcomd 2194 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
111, 2, 10syl2an 289 1 ((𝐴𝑉𝐵𝑊) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 979   = wceq 1363  wcel 2159  {cab 2174  Vcvv 2751  {csn 3606  {cpr 3607  cop 3609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-11 1516  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2170
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2175  df-cleq 2181  df-clel 2184  df-v 2753  df-op 3615
This theorem is referenced by:  dfop  3791  opexg  4242  opth1  4250  opth  4251  0nelop  4262  op1stbg  4493
  Copyright terms: Public domain W3C validator