Theorem rcp-RAA5 519

Description: Reductio ad Absurdum.

Hypotheses

Ref	Expression
rcp-RAA5.1	⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄ ∧ ¬ 𝛾₅) → 𝜑)
rcp-RAA5.2	⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄ ∧ ¬ 𝛾₅) → ¬ 𝜑)

Assertion

Ref	Expression
rcp-RAA5	⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄) → 𝛾₅)

Proof of Theorem rcp-RAA5

Step	Hyp	Ref	Expression
1		rcp-RAA5.1	. . 3 ⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄ ∧ ¬ 𝛾₅) → 𝜑)
2		rcp-RAA5.2	. . 3 ⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄ ∧ ¬ 𝛾₅) → ¬ 𝜑)
3	1, 2	rcp-NDNEGI5 222	. 2 ⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄) → ¬ ¬ 𝛾₅)
4	3	dnege-P3.30 276	1 ⊢ ((𝛾₁ ∧ 𝛾₂ ∧ 𝛾₃ ∧ 𝛾₄) → 𝛾₅)

Syntax hints:  ¬ wff-neg 9   → wff-imp 10   ∧ wff-rcp-AND4 162   ∧ wff-rcp-AND5 164

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-or-D2.3 145  df-true-D2.4 155  df-rcp-AND5 165

This theorem is referenced by: (None)