Theorem bnj1276 30139

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

Hypotheses

Ref	Expression
bnj1276.1	⊢ (𝜑 → ∀𝑥𝜑)
bnj1276.2	⊢ (𝜓 → ∀𝑥𝜓)
bnj1276.3	⊢ (𝜒 → ∀𝑥𝜒)
bnj1276.4	⊢ (𝜃 ↔ (𝜑 ∧ 𝜓 ∧ 𝜒))

Assertion

Ref	Expression
bnj1276	⊢ (𝜃 → ∀𝑥𝜃)

Proof of Theorem bnj1276

Step	Hyp	Ref	Expression
1		bnj1276.4	. 2 ⊢ (𝜃 ↔ (𝜑 ∧ 𝜓 ∧ 𝜒))
2		bnj1276.1	. . 3 ⊢ (𝜑 → ∀𝑥𝜑)
3		bnj1276.2	. . 3 ⊢ (𝜓 → ∀𝑥𝜓)
4		bnj1276.3	. . 3 ⊢ (𝜒 → ∀𝑥𝜒)
5	2, 3, 4	hb3an 2114	. 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → ∀𝑥(𝜑 ∧ 𝜓 ∧ 𝜒))
6	1, 5	hbxfrbi 1742	1 ⊢ (𝜃 → ∀𝑥𝜃)

Syntax hints:   → wi 4   ↔ wb 195   ∧ w3a 1031  ∀wal 1473

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701

This theorem is referenced by: (None)