Expand description
Tactics for Logical EQ.
Re-exports
pub use commute as symmetry;
Functions
false = false
.
(a = b) = c => a = (b = c)
.
((a = b) = c) = (a = (b = c))
.
(a = b) = c => (b = c) => a
.
(a = b) = c => a => (b = c)
(a = b) => (b = a)
.
(a = b) = (b = a)
.
¬(a = b) ∧ a => ¬b
.
a => (a = ¬¬a)
.
(a => b) = (¬a ∨ b)
.
(a = b) ∧ (a = c) => (c = b)
See transitivity.
¬(a = b) = ¬(c = b) => (a = c)
.
(false = a) => ¬a
.
(true = a) => a
.
(a = b) = (¬a = ¬b)
a = a
.
(¬a = ¬b) = (b = a)
.
(a = b) = c => (b = a) = c
.
a = (b = c) => a = (c = b)
.
¬a => (a == false)
.
(a = b) ∧ (b = c) => (a = c)
.
(a = b) = (c = d) => (a = c) = (b = d)
.
(a = b) = (c = b) => (a = c)
.
There is an a : A
is the same as A
being true.