Nuprl Theory sat_lemmas

(only non hidden objects are presented)

THMformula_not_sat_lemmaF:Formula. a:Assignment. a |= F a | F
THMformula_not_falsifiable_lemmaF:Formula. a:Assignment. a | F a |= F
THMformula_and_sat_lemmaa:Assignment. q,r:Formula. a |= qr a |= q a |= r
THMformula_and_sat_lemma1a:Assignment. q,r:Formula. a |= qr a |= q a |= r
THMformula_and_falsifiable_lemmaa:Assignment. q,r:Formula. a | qr a | q a | r
THMformula_or_sat_lemmaa:Assignment. q,r:Formula. a |= qr a |= q a |= r
THMformula_or_falsifiable_lemmaa:Assignment. q,r:Formula. a | qr a | q a | r
THMformula_imp_sat_lemmaa:Assignment. q,r:Formula. a |= qr a | q a |= r
THMformula_imp_falsifiable_lemmaa:Assignment. q,r:Formula. a | qr a |= q a | r
THMformula_falsifiable_lemma1a:Assignment. F:Formula. a | F a |= F
THMassignment_monotonea:Assignment. f:Formula. a':Assignment. a' extends a (a |= f a' |= f ) (a | f a' | f)

the other theories