Theorem nf3and 1901

Description: Deduction form of bound-variable hypothesis builder nf3an 1904. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 16-Oct-2016.)

Hypotheses

Ref	Expression
nfand.1	⊢ (𝜑 → Ⅎ𝑥𝜓)
nfand.2	⊢ (𝜑 → Ⅎ𝑥𝜒)
nfand.3	⊢ (𝜑 → Ⅎ𝑥𝜃)

Assertion

Ref	Expression
nf3and	⊢ (𝜑 → Ⅎ𝑥(𝜓 ∧ 𝜒 ∧ 𝜃))

Proof of Theorem nf3and

Step	Hyp	Ref	Expression
1		df-3an 1088	. 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜃) ↔ ((𝜓 ∧ 𝜒) ∧ 𝜃))
2		nfand.1	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜓)
3		nfand.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜒)
4	2, 3	nfand 1900	. . 3 ⊢ (𝜑 → Ⅎ𝑥(𝜓 ∧ 𝜒))
5		nfand.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝜃)
6	4, 5	nfand 1900	. 2 ⊢ (𝜑 → Ⅎ𝑥((𝜓 ∧ 𝜒) ∧ 𝜃))
7	1, 6	nfxfrd 1856	1 ⊢ (𝜑 → Ⅎ𝑥(𝜓 ∧ 𝜒 ∧ 𝜃))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086  Ⅎwnf 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-ex 1783  df-nf 1787

This theorem is referenced by:  nfttrcld  9468