Theorem bnj1262 34841

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

Hypotheses

Ref	Expression
bnj1262.1	⊢ 𝐴 ⊆ 𝐵
bnj1262.2	⊢ (𝜑 → 𝐶 = 𝐴)

Assertion

Ref	Expression
bnj1262	⊢ (𝜑 → 𝐶 ⊆ 𝐵)

Proof of Theorem bnj1262

Step	Hyp	Ref	Expression
1		bnj1262.2	. 2 ⊢ (𝜑 → 𝐶 = 𝐴)
2		bnj1262.1	. 2 ⊢ 𝐴 ⊆ 𝐵
3	1, 2	eqsstrdi 4003	1 ⊢ (𝜑 → 𝐶 ⊆ 𝐵)

Syntax hints:   → wi 4   = wceq 1540   ⊆ wss 3926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-9 2118  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-cleq 2727  df-ss 3943

This theorem is referenced by:  bnj229  34915  bnj1128  35021  bnj1145  35024