Theorem norel-P4.2a.RC 368

Description: Inference Form of norel-P4.2a 367. †

Hypothesis

Ref	Expression
norel-P4.2a.RC.1	⊢ ¬ (𝜑 ∨ 𝜓)

Assertion

Ref	Expression
norel-P4.2a.RC	⊢ ¬ 𝜓

Proof of Theorem norel-P4.2a.RC

Step	Hyp	Ref	Expression
1		norel-P4.2a.RC.1	. . . 4 ⊢ ¬ (𝜑 ∨ 𝜓)
2	1	ndtruei-P3.17 182	. . 3 ⊢ (⊤ → ¬ (𝜑 ∨ 𝜓))
3	2	norel-P4.2a 367	. 2 ⊢ (⊤ → ¬ 𝜓)
4	3	ndtruee-P3.18 183	1 ⊢ ¬ 𝜓

Syntax hints:  ¬ wff-neg 9   ∨ wff-or 144  ⊤wff-true 153

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

This theorem is referenced by: (None)