Theorem bnj1294 32091

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 3145	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓))
4		sp 2182	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜓) → (𝑥 ∈ 𝐴 → 𝜓))
5	4	impcom 410	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) → 𝜓)
6	3, 5	sylan2b 595	. 2 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓) → 𝜓)
7	1, 2, 6	syl2anc 586	1 ⊢ (𝜑 → 𝜓)

Syntax hints:   → wi 4  ∀wal 1535   ∈ wcel 2114  ∀wral 3140

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-12 2177

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-ral 3145

This theorem is referenced by:  bnj1379  32104  bnj1121  32259  bnj1279  32292  bnj1286  32293  bnj1296  32295  bnj1421  32316  bnj1489  32330  bnj1501  32341  bnj1523  32345