nfr - brismu bridi

	brismu bridi		< Previous Next > Nearby theorems
Mirrors > Home > Home > Th. List > nfr

Theorem nfr 360

Description: Property of not-free quantification. (Contributed by la korvo, 25-Jun-2024.)

**Assertion**
Ref	Expression
nfr	⊢ ganai na'a'u da zo'u broda gi ganai broda gi ro da zo'u broda

**Proof of Theorem nfr**
Step	Hyp	Ref	Expression
1		df-nahahu 357	. 2 ⊢ go na'a'u da zo'u broda gi ro da zo'u ganai broda gi ro da zo'u broda
2		ax-spec1 181	. 2 ⊢ ganai ro da zo'u ganai broda gi ro da zo'u broda gi ganai broda gi ro da zo'u broda
3	1, 2	sylbi 72	1 ⊢ ganai na'a'u da zo'u broda gi ganai broda gi ro da zo'u broda

Colors of variables: sumti selbri bridi

Syntax hints: ganai bgan 9 ro brd 177 na'a'u bnd 356

This theorem was proved from axioms: ax-mp 10 ax-k 11 ax-s 14 ax-ge-le 34 ax-spec1 181

This theorem depends on definitions: df-go 52 df-nahahu 357

This theorem is referenced by: nfri 361