Theorem bnj1213 35195

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

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2142   ⊆ wss 3904

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-clel 2837  df-ss 3921

This theorem is used by:  bnj1212  35196  bnj1173  35399  bnj1296  35418  bnj1408  35433  bnj1452  35449  bnj1523  35468