nf4r - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > nf4r		Unicode version

Theorem nf4r 1617

Description: If

is always true or always false, then variable

is effectively not free in

. The converse holds given a decidability condition, as seen at nf4dc 1616. (Contributed by Jim Kingdon, 21-Jul-2018.)

**Assertion**
Ref	Expression
nf4r	$\/$

**Proof of Theorem nf4r**
Step	Hyp	Ref	Expression
1		orcom 688	. . 3 $\/$ $\/$
2		alnex 1443	. . . 4
3	2	orbi2i 720	. . 3 $\/$ $\/$
4	1, 3	bitr4i 186	. 2 $\/$ $\/$
5		imorr 841	. . 3 $\/$
6		nf2 1614	. . 3
7	5, 6	sylibr 133	. 2 $\/$
8	4, 7	sylbir 134	1 $\/$

Colors of variables: wff set class

Syntax hints:

wn 3

wi 4 $\/$ wo 670

wal 1297

wnf 1404

wex 1436

This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 584 ax-in2 585 ax-io 671 ax-5 1391 ax-gen 1393 ax-ie2 1438 ax-4 1455 ax-ial 1482

This theorem depends on definitions: df-bi 116 df-tru 1302 df-fal 1305 df-nf 1405

This theorem is referenced by: (None)