In: Computer Science
Prove that (m → s) → (¬s → ¬m) ⇔ 1 using Boolean algebra and Propositional calculus
In first order logic, the conditional
A -> B
A
V B,
Using this,
(m->s) -> (s
->
m)
(m->s)
V (
s
->
m)
(
m
V s) V (
(
s)
V
m)
(
m
V s) V (
m V s)
Now consider A = (s V
m),
A
V A
1
This completes our proof.