Theorem bnj1351 32100

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

Hypothesis

Ref	Expression
bnj1351.1	⊢ (𝜑 → ∀𝑥𝜑)

Assertion

Ref	Expression
bnj1351	⊢ ((𝜑 ∧ 𝜓) → ∀𝑥(𝜑 ∧ 𝜓))

Distinct variable group:   𝜓,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bnj1351

Step	Hyp	Ref	Expression
1		bnj1351.1	. 2 ⊢ (𝜑 → ∀𝑥𝜑)
2		ax-5 1911	. 2 ⊢ (𝜓 → ∀𝑥𝜓)
3	1, 2	hban 2308	1 ⊢ ((𝜑 ∧ 𝜓) → ∀𝑥(𝜑 ∧ 𝜓))

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1535

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-10 2145  ax-12 2177

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785

This theorem is referenced by:  bnj1373  32304  bnj1445  32318