Theorem relun 5768

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 4144	. 2 ⊢ ((𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V))
2		df-rel 5639	. . 3 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V))
3		df-rel 5639	. . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
4	2, 3	anbi12i 629	. 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) ↔ (𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)))
5		df-rel 5639	. 2 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V))
6	1, 4, 5	3bitr4ri 304	1 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵))

Syntax hints:   ↔ wb 206   ∧ wa 395  Vcvv 3442   ∪ cun 3901   ⊆ wss 3903   × cxp 5630  Rel wrel 5637

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3444  df-un 3908  df-ss 3920  df-rel 5639

This theorem is referenced by:  difxp  6130  funun  6546  fununfun  6548  satfrel  35583  dfsucmap3  38714