Discrete Math Proof g - Can you please help me with a proof. Stuck at even getti

ID: 3120309 • Letter: D

Question

Discrete Math Proof g - Can you please help me with a proof. Stuck at even getting started.

If possible, can you explain the thought process of how you were able to solve the problem, and how to not get stuck please?

Formally prove that the conclusion (on the right) follows from the list of [comma-separated] hypotheses (to the left of the ==>).

Please note ^ means AND, v means or, <--> means biconditional, -> means if then/implies

So the hypothesis that are given are: b ^ c , (b <-> c) -> (h v g) ==> (g v h)

So far the only work I have done is simply putting the hypothesis down, where P means premise:

b ^ c P
(b <-> c) -> (h v g) P

==> (g v h)

b ^ c P
(b <-> c) -> (h v g) P

==> (g v h)

Now;

b ^ c ==> (b <--> c);

because b ^ c means b and c both true;

(b <--> c) also mean b and c both true;

b ^ c ==> (b <--> c);

(b <--> c) -> (h v g);

b ^ c ==> (h v g);

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.