Theorem bnj1213 35156

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

Hypotheses

Ref	Expression
bnj1213.1	⊢ 𝐴 ⊆ 𝐵
bnj1213.2	⊢ (𝜃 → 𝑥 ∈ 𝐴)

Assertion

Ref	Expression
bnj1213	⊢ (𝜃 → 𝑥 ∈ 𝐵)

Proof of Theorem bnj1213

Step	Hyp	Ref	Expression
1		bnj1213.1	. 2 ⊢ 𝐴 ⊆ 𝐵
2		bnj1213.2	. 2 ⊢ (𝜃 → 𝑥 ∈ 𝐴)
3	1, 2	sselid 3943	1 ⊢ (𝜃 → 𝑥 ∈ 𝐵)

Syntax hints:   → wi 4   ∈ wcel 2150   ⊆ 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

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1808  df-clel 2845  df-ss 3930

This theorem is referenced by:  bnj1212  35157  bnj1173  35360  bnj1296  35379  bnj1408  35394  bnj1452  35410  bnj1523  35429