Theorem sneqrg 4798

Description: Closed form of sneqr 4799. (Contributed by Scott Fenton, 1-Apr-2011.) (Proof shortened by JJ, 23-Jul-2021.)

Assertion

Ref	Expression
sneqrg	⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 = 𝐵))

Proof of Theorem sneqrg

Step	Hyp	Ref	Expression
1		snidg 4620	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
2		eleq2 2849	. . 3 ⊢ ({𝐴} = {𝐵} → (𝐴 ∈ {𝐴} ↔ 𝐴 ∈ {𝐵}))
3	1, 2	syl5ibcom 248	. 2 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 ∈ {𝐵}))
4		elsng 4597	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))
5	3, 4	sylibd 242	1 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {csn 4583

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-sn 4584

This theorem is used by:  sneqr  4799  sneqbg  4802  snsssng  33110  preimane  33263  altopth1  36730  altopth2  36731  diag1f1lem  50414  diag2f1lem  50416