Theorem bnj1294 32846

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

Hypotheses

Ref	Expression
bnj1294.1	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)
bnj1294.2	⊢ (𝜑 → 𝑥 ∈ 𝐴)

Assertion

Ref	Expression
bnj1294	⊢ (𝜑 → 𝜓)

Proof of Theorem bnj1294

Step	Hyp	Ref	Expression
1		bnj1294.2	. 2 ⊢ (𝜑 → 𝑥 ∈ 𝐴)
2		bnj1294.1	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)
3		df-ral 3063	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓))
4		sp 2174	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜓) → (𝑥 ∈ 𝐴 → 𝜓))
5	4	impcom 409	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) → 𝜓)
6	3, 5	sylan2b 595	. 2 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓) → 𝜓)
7	1, 2, 6	syl2anc 585	1 ⊢ (𝜑 → 𝜓)

Syntax hints:   → wi 4  ∀wal 1537   ∈ wcel 2104  ∀wral 3062

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 1911  ax-6 1969  ax-7 2009  ax-12 2169

This theorem depends on definitions:  df-bi 206  df-an 398  df-ex 1780  df-ral 3063

This theorem is referenced by:  bnj1379  32859  bnj1121  33014  bnj1279  33047  bnj1286  33048  bnj1296  33050  bnj1421  33071  bnj1489  33085  bnj1501  33096  bnj1523  33100