Theorem norel-P4.2a.CL 369

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

Assertion

Ref	Expression
norel-P4.2a.CL	⊢ (¬ (𝜑 ∨ 𝜓) → ¬ 𝜓)

Proof of Theorem norel-P4.2a.CL

Step	Hyp	Ref	Expression
1		rcp-NDASM1of1 192	. 2 ⊢ (¬ (𝜑 ∨ 𝜓) → ¬ (𝜑 ∨ 𝜓))
2	1	norel-P4.2a 367	1 ⊢ (¬ (𝜑 ∨ 𝜓) → ¬ 𝜓)

Syntax hints:  ¬ wff-neg 9   → wff-imp 10   ∨ wff-or 144

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:  dmorgafwd-L4.1  452  dmorgbfwd-L4.3  454