Theorem sneqrg 4797

Description: Closed form of sneqr 4798. (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 4621	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
2		eleq2 2853	. . 3 ⊢ ({𝐴} = {𝐵} → (𝐴 ∈ {𝐴} ↔ 𝐴 ∈ {𝐵}))
3	1, 2	syl5ibcom 248	. 2 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 ∈ {𝐵}))
4		elsng 4598	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))
5	3, 4	sylibd 242	1 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {csn 4588

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-sn 4589

This theorem is used by:  sneqr  4798  sneqbg  4801  snsssng  33179  preimane  33332  altopth1  36907  altopth2  36908  diag1f1lem  50631  diag2f1lem  50633