nf4r - Intuitionistic Logic Explorer

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

Theorem nf4r 1685

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 1684. (Contributed by Jim Kingdon, 21-Jul-2018.)

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

**Proof of Theorem nf4r**
Step	Hyp	Ref	Expression
1		orcom 729	. . 3 $\/$ $\/$
2		alnex 1513	. . . 4
3	2	orbi2i 763	. . 3 $\/$ $\/$
4	1, 3	bitr4i 187	. 2 $\/$ $\/$
5		imorr 722	. . 3 $\/$
6		nf2 1682	. . 3
7	5, 6	sylibr 134	. 2 $\/$
8	4, 7	sylbir 135	1 $\/$

Colors of variables: wff set class

Syntax hints:

wn 3

wi 4 $\/$ wo 709

wal 1362

wnf 1474

wex 1506

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-gen 1463 ax-ie2 1508 ax-4 1524 ax-ial 1548

This theorem depends on definitions: df-bi 117 df-tru 1367 df-fal 1370 df-nf 1475

This theorem is referenced by: (None)