Theorem bnj1293 35174

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 4198	. 2 ⊢ (𝐵 ∩ 𝐶) ⊆ 𝐶
3	1, 2	eqsstri 3991	1 ⊢ 𝐴 ⊆ 𝐶

Syntax hints:   = wceq 1568   ∩ cin 3912   ⊆ wss 3913

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-ext 2742

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-ex 1808  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845  df-rab 3424  df-v 3464  df-in 3920  df-ss 3930

This theorem is referenced by:  bnj1253  35375  bnj1286  35377  bnj1280  35378  bnj1296  35379