Metamath Proof Explorer


Theorem relun

Description: The union of two relations is a relation. Compare Exercise 5 of TakeutiZaring p. 25. (Contributed by NM, 12-Aug-1994)

Ref Expression
Assertion relun ⊢ Rel ⁡ A ∪ B ↔ Rel ⁡ A ∧ Rel ⁡ B

Proof

Step Hyp Ref Expression
1 unss ⊢ A ⊆ V × V ∧ B ⊆ V × V ↔ A ∪ B ⊆ V × V
2 df-rel ⊢ Rel ⁡ A ↔ A ⊆ V × V
3 df-rel ⊢ Rel ⁡ B ↔ B ⊆ V × V
4 2 3 anbi12i ⊢ Rel ⁡ A ∧ Rel ⁡ B ↔ A ⊆ V × V ∧ B ⊆ V × V
5 df-rel ⊢ Rel ⁡ A ∪ B ↔ A ∪ B ⊆ V × V
6 1 4 5 3bitr4ri ⊢ Rel ⁡ A ∪ B ↔ Rel ⁡ A ∧ Rel ⁡ B