![]() |
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 4111 | . 2 ⊢ ((𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V)) | |
2 | df-rel 5526 | . . 3 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V)) | |
3 | df-rel 5526 | . . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V)) | |
4 | 2, 3 | anbi12i 629 | . 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) ↔ (𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V))) |
5 | df-rel 5526 | . 2 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (𝐴 ∪ 𝐵) ⊆ (V × V)) | |
6 | 1, 4, 5 | 3bitr4ri 307 | 1 ⊢ (Rel (𝐴 ∪ 𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 Vcvv 3441 ∪ cun 3879 ⊆ wss 3881 × cxp 5517 Rel wrel 5524 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-rel 5526 |
This theorem is referenced by: difxp 5988 funun 6370 fununfun 6372 satfrel 32727 |
Copyright terms: Public domain | W3C validator |