Theorem funsneqopb 7099

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

Step	Hyp	Ref	Expression
1		funsndifnop.g	. . . 4 ⊢ 𝐺 = {⟨𝐴, 𝐵⟩}
2		opeq1 4817	. . . . . 6 ⊢ (𝐴 = 𝐵 → ⟨𝐴, 𝐵⟩ = ⟨𝐵, 𝐵⟩)
3	2	sneqd 4580	. . . . 5 ⊢ (𝐴 = 𝐵 → {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐵⟩})
4		funsndifnop.b	. . . . . 6 ⊢ 𝐵 ∈ V
5	4	snopeqopsnid 5457	. . . . 5 ⊢ {⟨𝐵, 𝐵⟩} = ⟨{𝐵}, {𝐵}⟩
6	3, 5	eqtrdi 2788	. . . 4 ⊢ (𝐴 = 𝐵 → {⟨𝐴, 𝐵⟩} = ⟨{𝐵}, {𝐵}⟩)
7	1, 6	eqtrid 2784	. . 3 ⊢ (𝐴 = 𝐵 → 𝐺 = ⟨{𝐵}, {𝐵}⟩)
8		snex 5376	. . . 4 ⊢ {𝐵} ∈ V
9	8, 8	opelvv 5664	. . 3 ⊢ ⟨{𝐵}, {𝐵}⟩ ∈ (V × V)
10	7, 9	eqeltrdi 2845	. 2 ⊢ (𝐴 = 𝐵 → 𝐺 ∈ (V × V))
11		funsndifnop.a	. . . 4 ⊢ 𝐴 ∈ V
12	11, 4, 1	funsndifnop 7098	. . 3 ⊢ (𝐴 ≠ 𝐵 → ¬ 𝐺 ∈ (V × V))
13	12	necon4ai 2964	. 2 ⊢ (𝐺 ∈ (V × V) → 𝐴 = 𝐵)
14	10, 13	impbii 209	1 ⊢ (𝐴 = 𝐵 ↔ 𝐺 ∈ (V × V))

Syntax hints:   ↔ wb 206   = wceq 1542   ∈ wcel 2114  Vcvv 3430  {csn 4568  ⟨cop 4574   × cxp 5622

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500

This theorem is referenced by: (None)