Theorem bnj1213 32778

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 3919	1 ⊢ (𝜃 → 𝑥 ∈ 𝐵)

Syntax hints:   → wi 4   ∈ wcel 2106   ⊆ wss 3887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-v 3434  df-in 3894  df-ss 3904

This theorem is referenced by:  bnj1212  32779  bnj1173  32982  bnj1296  33001  bnj1408  33016  bnj1452  33032  bnj1523  33051