Theorem nfrnegconv-P8.RC 1111

Description: Inference Form of nfrnegconv-P8 1110.

This statement is not deducible with intuitionist logic.

Hypothesis

Ref	Expression
nfrnegconv-P8.RC.1	⊢ Ⅎ𝑥 ¬ 𝜑

Assertion

Ref	Expression
nfrnegconv-P8.RC	⊢ Ⅎ𝑥𝜑

Proof of Theorem nfrnegconv-P8.RC

Step	Hyp	Ref	Expression
1		nfrnegconv-P8.RC.1	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜑
2	1	ndtruei-P3.17 182	. . 3 ⊢ (⊤ → Ⅎ𝑥 ¬ 𝜑)
3	2	nfrnegconv-P8 1110	. 2 ⊢ (⊤ → Ⅎ𝑥𝜑)
4	3	ndtruee-P3.18 183	1 ⊢ Ⅎ𝑥𝜑

Syntax hints:  ¬ wff-neg 9  ⊤wff-true 153  Ⅎwff-nfree 681

This theorem was proved from axioms:  ax-L1 11  ax-L2 12  ax-L3 13  ax-MP 14  ax-GEN 15  ax-L4 16  ax-L5 17  ax-L6 18  ax-L7 19  ax-L10 27  ax-L11 28  ax-L12 29

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  df-rcp-AND3 161  df-exists-D5.1 596  df-nfree-D6.1 682  df-psub-D6.2 716

This theorem is referenced by: (None)