naari - brismu bridi

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

Theorem naari 113

Description: Reverse inference form of df-na.a 110 (Contributed by la korvo, 17-Aug-2023.)

**Hypothesis**
Ref	Expression
naari.0	⊢ ganai ko'a bo'a gi ko'e bo'a

**Assertion**
Ref	Expression
naari	⊢ ko'a na.a ko'e bo'a

**Proof of Theorem naari**
Step	Hyp	Ref	Expression
1		naari.0	. 2 ⊢ ganai ko'a bo'a gi ko'e bo'a
2		df-na.a 110	. 2 ⊢ go ko'a na.a ko'e bo'a gi ganai ko'a bo'a gi ko'e bo'a
3	1, 2	bi-rev 102	1 ⊢ ko'a na.a ko'e bo'a

Colors of variables: sumti selbri bridi

Syntax hints: btb 3 ganai bgan 9 na.a sjnaa 109

This theorem was proved from axioms: ax-mp 10 ax-k 11 ax-s 15 ax-ge-le 48 ax-ge-re 49 ax-ge-in 50

This theorem depends on definitions: df-go 83 df-na.a 110

This theorem is referenced by: na.a-refl 114 gripauris 337