Theorem funsndifnop 7096

Description: A singleton of an ordered pair is not an ordered pair if the components are different. (Contributed by AV, 23-Sep-2020.) (Avoid depending on this detail.)

Hypotheses

Ref	Expression
funsndifnop.a	⊢ 𝐴 ∈ V
funsndifnop.b	⊢ 𝐵 ∈ V
funsndifnop.g	⊢ 𝐺 = {⟨𝐴, 𝐵⟩}

Assertion

Ref	Expression
funsndifnop	⊢ (𝐴 ≠ 𝐵 → ¬ 𝐺 ∈ (V × V))

Proof of Theorem funsndifnop

Dummy variables 𝑎 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elvv 5697	. . 3 ⊢ (𝐺 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐺 = ⟨𝑥, 𝑦⟩)
2		funsndifnop.g	. . . . . 6 ⊢ 𝐺 = {⟨𝐴, 𝐵⟩}
3		funsndifnop.a	. . . . . . . 8 ⊢ 𝐴 ∈ V
4		funsndifnop.b	. . . . . . . 8 ⊢ 𝐵 ∈ V
5	3, 4	funsn 6543	. . . . . . 7 ⊢ Fun {⟨𝐴, 𝐵⟩}
6		funeq 6510	. . . . . . 7 ⊢ (𝐺 = {⟨𝐴, 𝐵⟩} → (Fun 𝐺 ↔ Fun {⟨𝐴, 𝐵⟩}))
7	5, 6	mpbiri 258	. . . . . 6 ⊢ (𝐺 = {⟨𝐴, 𝐵⟩} → Fun 𝐺)
8	2, 7	ax-mp 5	. . . . 5 ⊢ Fun 𝐺
9		funeq 6510	. . . . . . 7 ⊢ (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun 𝐺 ↔ Fun ⟨𝑥, 𝑦⟩))
10		vex 3434	. . . . . . . 8 ⊢ 𝑥 ∈ V
11		vex 3434	. . . . . . . 8 ⊢ 𝑦 ∈ V
12	10, 11	funop 7094	. . . . . . 7 ⊢ (Fun ⟨𝑥, 𝑦⟩ ↔ ∃𝑎(𝑥 = {𝑎} ∧ ⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩}))
13	9, 12	bitrdi 287	. . . . . 6 ⊢ (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun 𝐺 ↔ ∃𝑎(𝑥 = {𝑎} ∧ ⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩})))
14		eqeq2 2749	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩} → (𝐺 = ⟨𝑥, 𝑦⟩ ↔ 𝐺 = {⟨𝑎, 𝑎⟩}))
15		eqeq1 2741	. . . . . . . . . . . . 13 ⊢ (𝐺 = {⟨𝐴, 𝐵⟩} → (𝐺 = {⟨𝑎, 𝑎⟩} ↔ {⟨𝐴, 𝐵⟩} = {⟨𝑎, 𝑎⟩}))
16		opex 5409	. . . . . . . . . . . . . . 15 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
17	16	sneqr 4784	. . . . . . . . . . . . . 14 ⊢ ({⟨𝐴, 𝐵⟩} = {⟨𝑎, 𝑎⟩} → ⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑎⟩)
18	3, 4	opth 5422	. . . . . . . . . . . . . . 15 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑎⟩ ↔ (𝐴 = 𝑎 ∧ 𝐵 = 𝑎))
19		eqtr3 2759	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 = 𝑎 ∧ 𝐵 = 𝑎) → 𝐴 = 𝐵)
20	19	a1d 25	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 = 𝑎 ∧ 𝐵 = 𝑎) → (𝑥 = {𝑎} → 𝐴 = 𝐵))
21	18, 20	sylbi 217	. . . . . . . . . . . . . 14 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑎⟩ → (𝑥 = {𝑎} → 𝐴 = 𝐵))
22	17, 21	syl 17	. . . . . . . . . . . . 13 ⊢ ({⟨𝐴, 𝐵⟩} = {⟨𝑎, 𝑎⟩} → (𝑥 = {𝑎} → 𝐴 = 𝐵))
23	15, 22	biimtrdi 253	. . . . . . . . . . . 12 ⊢ (𝐺 = {⟨𝐴, 𝐵⟩} → (𝐺 = {⟨𝑎, 𝑎⟩} → (𝑥 = {𝑎} → 𝐴 = 𝐵)))
24	2, 23	ax-mp 5	. . . . . . . . . . 11 ⊢ (𝐺 = {⟨𝑎, 𝑎⟩} → (𝑥 = {𝑎} → 𝐴 = 𝐵))
25	14, 24	biimtrdi 253	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩} → (𝐺 = ⟨𝑥, 𝑦⟩ → (𝑥 = {𝑎} → 𝐴 = 𝐵)))
26	25	com23 86	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩} → (𝑥 = {𝑎} → (𝐺 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝐵)))
27	26	impcom 407	. . . . . . . 8 ⊢ ((𝑥 = {𝑎} ∧ ⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩}) → (𝐺 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝐵))
28	27	exlimiv 1932	. . . . . . 7 ⊢ (∃𝑎(𝑥 = {𝑎} ∧ ⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩}) → (𝐺 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝐵))
29	28	com12 32	. . . . . 6 ⊢ (𝐺 = ⟨𝑥, 𝑦⟩ → (∃𝑎(𝑥 = {𝑎} ∧ ⟨𝑥, 𝑦⟩ = {⟨𝑎, 𝑎⟩}) → 𝐴 = 𝐵))
30	13, 29	sylbid 240	. . . . 5 ⊢ (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun 𝐺 → 𝐴 = 𝐵))
31	8, 30	mpi 20	. . . 4 ⊢ (𝐺 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝐵)
32	31	exlimivv 1934	. . 3 ⊢ (∃𝑥∃𝑦 𝐺 = ⟨𝑥, 𝑦⟩ → 𝐴 = 𝐵)
33	1, 32	sylbi 217	. 2 ⊢ (𝐺 ∈ (V × V) → 𝐴 = 𝐵)
34	33	necon3ai 2958	1 ⊢ (𝐴 ≠ 𝐵 → ¬ 𝐺 ∈ (V × V))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  Vcvv 3430  {csn 4568  ⟨cop 4574   × cxp 5620  Fun wfun 6484

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 5368

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 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498

This theorem is referenced by:  funsneqopb  7097  snstrvtxval  29125  snstriedgval  29126