Theorem bnj1322 32089

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 4023	. 2 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵)
2		df-ss 3952	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
3	1, 2	sylib 220	1 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ 𝐵) = 𝐴)

Syntax hints:   → wi 4   = wceq 1533   ∩ cin 3935   ⊆ wss 3936

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-in 3943  df-ss 3952

This theorem is referenced by:  bnj1321  32294