Theorem falseprofeliml-P4.7a 393

Description: Process of Elimination Utilising '⊥' (left). †

Hypotheses

Ref	Expression
falseprofeliml-P4.7a.1	⊢ (𝛾 → (𝜑 ∨ 𝜓))
falseprofeliml-P4.7a.2	⊢ (𝛾 → (𝜑 → ⊥))

Assertion

Ref	Expression
falseprofeliml-P4.7a	⊢ (𝛾 → 𝜓)

Proof of Theorem falseprofeliml-P4.7a

Step	Hyp	Ref	Expression
1		falseprofeliml-P4.7a.1	. 2 ⊢ (𝛾 → (𝜑 ∨ 𝜓))
2		rcp-NDASM2of2 194	. . . 4 ⊢ ((𝛾 ∧ 𝜑) → 𝜑)
3		falseprofeliml-P4.7a.2	. . . . 5 ⊢ (𝛾 → (𝜑 → ⊥))
4	3	rcp-NDIMP1add1 208	. . . 4 ⊢ ((𝛾 ∧ 𝜑) → (𝜑 → ⊥))
5	2, 4	ndime-P3.6 171	. . 3 ⊢ ((𝛾 ∧ 𝜑) → ⊥)
6	5	falseimpoe-P4.4c 383	. . 3 ⊢ ((𝛾 ∧ 𝜑) → ¬ ⊥)
7	5, 6	rcp-NDNEGI2 219	. 2 ⊢ (𝛾 → ¬ 𝜑)
8	1, 7	profeliml-P4.5a 385	1 ⊢ (𝛾 → 𝜓)

Syntax hints:  ¬ wff-neg 9   → wff-imp 10   ∧ wff-and 132   ∨ wff-or 144  ⊥wff-false 157

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-false-D2.5 158

This theorem is referenced by:  falseprofeliml-P4.7a.RC  394