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

Theorem funsneqopb 7188
Description: A singleton of an ordered pair is an ordered pair iff the components are equal. (Contributed by AV, 24-Sep-2020.) (Avoid depending on this detail.)
Hypotheses
Ref Expression
funsndifnop.a 𝐴 ∈ V
funsndifnop.b 𝐵 ∈ V
funsndifnop.g 𝐺 = {⟨𝐴, 𝐵⟩}
Assertion
Ref Expression
funsneqopb (𝐴 = 𝐵 ↔ 𝐺 ∈ (V × V))

Proof of Theorem funsneqopb
StepHypRef Expression
1 funsndifnop.g . . . 4 𝐺 = {⟨𝐴, 𝐵⟩}
2 opeq1 4845 . . . . . 6 (𝐴 = 𝐵 → ⟨𝐴, 𝐵⟩ = ⟨𝐵, 𝐵⟩)
32sneqd 4596 . . . . 5 (𝐴 = 𝐵 → {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐵⟩})
4 funsndifnop.b . . . . . 6 𝐵 ∈ V
54snopeqopsnid 5488 . . . . 5 {⟨𝐵, 𝐵⟩} = ⟨{𝐵}, {𝐵}⟩
63, 5eqtrdi 2814 . . . 4 (𝐴 = 𝐵 → {⟨𝐴, 𝐵⟩} = ⟨{𝐵}, {𝐵}⟩)
71, 6eqtrid 2810 . . 3 (𝐴 = 𝐵 → 𝐺 = ⟨{𝐵}, {𝐵}⟩)
8 snex 5404 . . . 4 {𝐵} ∈ V
98, 8opelvv 5698 . . 3 ⟨{𝐵}, {𝐵}⟩ ∈ (V × V)
107, 9eqeltrdi 2872 . 2 (𝐴 = 𝐵 → 𝐺 ∈ (V × V))
11 funsndifnop.a . . . 4 𝐴 ∈ V
1211, 4, 1funsndifnop 7187 . . 3 (𝐴 ≠ 𝐵 → ¬ 𝐺 ∈ (V × V))
1312necon4ai 2990 . 2 (𝐺 ∈ (V × V) → 𝐴 = 𝐵)
1410, 13impbii 212 1 (𝐴 = 𝐵 ↔ 𝐺 ∈ (V × V))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588  ⟨cop 4840   × cxp 5656
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator