Description: A lower bound on the CNF function. Since ( ( A CNF B )F ) is defined as the sum of ( A ^o x ) .o ( Fx ) over all x in the support of F , it is larger than any of these terms (and all other terms are zero, so we can extend the statement to all C e. B instead of just those C in the support). (Contributed by Mario Carneiro, 28-May-2015) (Revised by AV, 28-Jun-2019)
Ref | Expression | ||
---|---|---|---|
Hypotheses | cantnfs.s | |
|
cantnfs.a | |
||
cantnfs.b | |
||
cantnfcl.g | |
||
cantnfcl.f | |
||
cantnfval.h | |
||
cantnfle.c | |
||
Assertion | cantnfle | |