Theorem bnj1293 34951

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

Hypothesis

Ref	Expression
bnj1293.1	⊢ 𝐴 = (𝐵 ∩ 𝐶)

Assertion

Ref	Expression
bnj1293	⊢ 𝐴 ⊆ 𝐶

Proof of Theorem bnj1293

Step	Hyp	Ref	Expression
1		bnj1293.1	. 2 ⊢ 𝐴 = (𝐵 ∩ 𝐶)
2		inss2 4189	. 2 ⊢ (𝐵 ∩ 𝐶) ⊆ 𝐶
3	1, 2	eqsstri 3979	1 ⊢ 𝐴 ⊆ 𝐶

Syntax hints:   = wceq 1542   ∩ cin 3899   ⊆ wss 3900

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

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-rab 3399  df-v 3441  df-in 3907  df-ss 3917

This theorem is referenced by:  bnj1253  35152  bnj1286  35154  bnj1280  35155  bnj1296  35156