Theorem relun 5835

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

Assertion

Ref	Expression
relun	⊢ (Rel (𝐴 ∪ 𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵))

Proof of Theorem relun

Step	Hyp	Ref	Expression
1		unss 4213	. 2 ⊢ ((𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V))
2		df-rel 5707	. . 3 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V))
3		df-rel 5707	. . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
4	2, 3	anbi12i 627	. 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) ↔ (𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)))
5		df-rel 5707	. 2 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V))
6	1, 4, 5	3bitr4ri 304	1 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵))

Syntax hints:   ↔ wb 206   ∧ wa 395  Vcvv 3488   ∪ cun 3974   ⊆ wss 3976   × cxp 5698  Rel wrel 5705

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490  df-un 3981  df-ss 3993  df-rel 5707

This theorem is referenced by:  difxp  6195  funun  6624  fununfun  6626  satfrel  35335