Given P is T, q is F and r is F.
Let us find p ↔ q first.
↔ is called bi-conditional operator and is true when p and q both are matched.
Since here p is T and q is F, p↔q is F. ( Since p and q are not matching)
~p v r = ~T v F = F v F = F
Hence (p↔q)→(~pvr) = F → F = T (Since conditional operator → is false if and if first proposition is T and second proposition is F, for all other values it is T)
