| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relun | Structured version Visualization version GIF version | ||
| Description: The union of two relations is a relation. Compare Exercise 5 of [TakeutiZaring] p. 25. (Contributed by NM, 12-Aug-1994.) |
| Ref | Expression |
|---|---|
| relun | ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unss 4191 | . 2 ⊢ ((𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V)) | |
| 2 | df-rel 5665 | . . 3 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V)) | |
| 3 | df-rel 5665 | . . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V)) | |
| 4 | 2, 3 | anbi12i 640 | . 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) ↔ (𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V))) |
| 5 | df-rel 5665 | . 2 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V)) | |
| 6 | 1, 4, 5 | 3bitr4ri 307 | 1 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 Vcvv 3454 ⊆ wss 3900 ∪ cun 4152 × cxp 5656 Rel wrel 5663 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-un 4154 df-rel 5665 |
| This theorem is used by: difxp 6173 funun 6614 fununfunOLD 6617 satfrel 36340 dfsucmap3 39661 relpropg 46243 |
| Copyright terms: Public domain | W3C validator |