Theorem relun 5679

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

Syntax hints:   ↔ wb 208   ∧ wa 398  Vcvv 3495   ∪ cun 3934   ⊆ wss 3936   × cxp 5548  Rel wrel 5555

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3497  df-un 3941  df-in 3943  df-ss 3952  df-rel 5557

This theorem is referenced by:  difxp  6016  funun  6395  fununfun  6397  satfrel  32609