Theorem bnj1322 35452

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Assertion

Ref	Expression
bnj1322	⊢ (𝐴 = 𝐵 → (𝐴 ∩ 𝐵) = 𝐴)

Proof of Theorem bnj1322

Step	Hyp	Ref	Expression
1		eqimss 3966	. 2 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵)
2		dfss2 4094	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
3	1, 2	sylib 221	1 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ 𝐵) = 𝐴)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ⊆ wss 3895   ∩ cin 4089

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-3an 1105  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ss 3896  df-in 4091

This theorem is used by:  bnj1321  35657