Theorem bnj228 34265

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

Hypothesis

Ref	Expression
bnj228.1	⊢ (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜓)

Assertion

Ref	Expression
bnj228	⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓)

Proof of Theorem bnj228

Step	Hyp	Ref	Expression
1		bnj228.1	. . 3 ⊢ (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜓)
2		rsp 3236	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜓 → (𝑥 ∈ 𝐴 → 𝜓))
3	1, 2	sylbi 216	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝜓))
4	3	impcom 407	1 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∈ wcel 2098  ∀wral 3053

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-12 2163

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1774  df-ral 3054

This theorem is referenced by:  bnj229  34414  bnj999  34488