00:01
Okay, so we will be verifying the first d morgan law, which is that the negation of p and q is logically equivalent to the negation of p or the negation of q.
00:11
We will be doing this using a truth table.
00:13
So first, let's write all of our values for the truth table.
00:21
So first, we write all the possible values of p and q.
00:27
So p is true, q is true, p is true, q is false, t is false.
00:36
Fold, q is true, and p and q are both fold.
00:44
These are all possible combinations of p and q.
00:47
Now for p and q to be true, both p and q must be true.
00:51
So when both p and q are true, we have this is true, but then for the rest of them, you observe that only one of them is true or none of them are true, so all of the other ones must be false.
01:07
Now if the negation of p and q is true, then the negation must be false.
01:15
Right here, p and q is false for all of them.
01:18
Therefore, the negation of p and q must be true.
01:24
Now, if p is true, then its negation is false...