Theorem nprofeliml-P4.6a 389

Description: Negated Process of Elimination (left). †

Hypotheses

Ref	Expression
nprofeliml-P4.6a.1	⊢ (𝛾 → ¬ (𝜑 ∧ 𝜓))
nprofeliml-P4.6a.2	⊢ (𝛾 → 𝜑)

Assertion

Ref	Expression
nprofeliml-P4.6a	⊢ (𝛾 → ¬ 𝜓)

Proof of Theorem nprofeliml-P4.6a

Step	Hyp	Ref	Expression
1		nprofeliml-P4.6a.2	. . . 4 ⊢ (𝛾 → 𝜑)
2	1	rcp-NDIMP1add1 208	. . 3 ⊢ ((𝛾 ∧ 𝜓) → 𝜑)
3		rcp-NDASM2of2 194	. . 3 ⊢ ((𝛾 ∧ 𝜓) → 𝜓)
4	2, 3	ndandi-P3.7 172	. 2 ⊢ ((𝛾 ∧ 𝜓) → (𝜑 ∧ 𝜓))
5		nprofeliml-P4.6a.1	. . 3 ⊢ (𝛾 → ¬ (𝜑 ∧ 𝜓))
6	5	rcp-NDIMP1add1 208	. 2 ⊢ ((𝛾 ∧ 𝜓) → ¬ (𝜑 ∧ 𝜓))
7	4, 6	rcp-NDNEGI2 219	1 ⊢ (𝛾 → ¬ 𝜓)

Syntax hints:  ¬ wff-neg 9   → wff-imp 10   ∧ wff-and 132

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

This theorem is referenced by:  nprofeliml-P4.6a.RC  390  sepimandl-P4.9d  415