Javascript Interactive Higher-Order Theorem Prover
Let A be an object. Let R be an object such that R is a binary relation on A. Let S be an object such that S is a binary relation on A. Let a and b be members of A. Assume ⟨a,b⟩∈S. Then we have ⟨a,b⟩∈R∪S.
The following background is necessary to understand this theorem.
(.) Let A and x be objects. Then x∈A is a proposition.
(.) Let A and B be objects. Then "A∪B" is an object.
(.) Let x and y be objects. Then "⟨x,y⟩" is an object.
(.) Let A and R be objects. Then "R is a binary relation on A" is a proposition.
The following background is necessary for the proof.
(.) Let A, B and x be objects. Assume x∈B. Then we know x∈A∪B.
Trivial.
Click here to modify variable names (JavaScript Must Be Enabled).
Hide Background.
Test yourself on this item.
Theorem Theorem Theorem
