MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relun Structured version   Visualization version   GIF version

Theorem relun 5760
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
StepHypRef Expression
1 unss 4131 . 2 ((𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)) ↔ (𝐴𝐵) ⊆ (V × V))
2 df-rel 5631 . . 3 (Rel 𝐴𝐴 ⊆ (V × V))
3 df-rel 5631 . . 3 (Rel 𝐵𝐵 ⊆ (V × V))
42, 3anbi12i 629 . 2 ((Rel 𝐴 ∧ Rel 𝐵) ↔ (𝐴 ⊆ (V × V) ∧ 𝐵 ⊆ (V × V)))
5 df-rel 5631 . 2 (Rel (𝐴𝐵) ↔ (𝐴𝐵) ⊆ (V × V))
61, 4, 53bitr4ri 304 1 (Rel (𝐴𝐵) ↔ (Rel 𝐴 ∧ Rel 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  Vcvv 3430  cun 3888  wss 3890   × cxp 5622  Rel wrel 5629
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 3432  df-un 3895  df-ss 3907  df-rel 5631
This theorem is referenced by:  difxp  6122  funun  6538  fununfun  6540  satfrel  35565  dfsucmap3  38798
  Copyright terms: Public domain W3C validator