Theorem rcp-NDIMP3add1 210

Description: ( 1 ∧ 2 ∧ 3 ) ⇒ ( 1 ∧ 2 ∧ 3 ∧ 4 ). †

Hypothesis

Ref	Expression
rcp-NDIMP3add1.1	⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃) → 𝜑)

Assertion

Ref	Expression
rcp-NDIMP3add1	⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄) → 𝜑)

Proof of Theorem rcp-NDIMP3add1

Step	Hyp	Ref	Expression
1		rcp-NDIMP3add1.1	. . 3 ⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃) → 𝜑)
2	1	ndimp-P3.2 167	. 2 ⊢ (((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃) ∧ 𝛾₄) → 𝜑)
3	2	rcp-NDJOIN4 190	1 ⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄) → 𝜑)

Syntax hints:   → wff-imp 10   ∧ wff-rcp-AND3 160   ∧ wff-rcp-AND4 162

This theorem was proved from axioms:  ax-L1 11  ax-L2 12  ax-L3 13  ax-MP 14

This theorem depends on definitions:  df-bi-D2.1 107  df-and-D2.2 133  df-rcp-AND4 163

This theorem is referenced by:  rcp-NDIMP2add2  213  rcp-NDIMP3add2  214  rcp-NDIMP1add3  215  example-E3.2b  312