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

Theorem coeq0 6251
Description: A composition of two relations is empty iff there is no overlap between the range of the second and the domain of the first. Useful in combination with coundi 6243 and coundir 6244 to prune meaningless terms in the result. (Contributed by Stefan O'Rear, 8-Oct-2014.)
Assertion
Ref Expression
coeq0 ((𝐴𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)

Proof of Theorem coeq0
StepHypRef Expression
1 relco 6104 . . 3 Rel (𝐴𝐵)
2 relrn0 5966 . . 3 (Rel (𝐴𝐵) → ((𝐴𝐵) = ∅ ↔ ran (𝐴𝐵) = ∅))
31, 2ax-mp 5 . 2 ((𝐴𝐵) = ∅ ↔ ran (𝐴𝐵) = ∅)
4 rnco 6248 . . 3 ran (𝐴𝐵) = ran (𝐴 ↾ ran 𝐵)
54eqeq1i 2737 . 2 (ran (𝐴𝐵) = ∅ ↔ ran (𝐴 ↾ ran 𝐵) = ∅)
6 relres 6008 . . . 4 Rel (𝐴 ↾ ran 𝐵)
7 reldm0 5925 . . . 4 (Rel (𝐴 ↾ ran 𝐵) → ((𝐴 ↾ ran 𝐵) = ∅ ↔ dom (𝐴 ↾ ran 𝐵) = ∅))
86, 7ax-mp 5 . . 3 ((𝐴 ↾ ran 𝐵) = ∅ ↔ dom (𝐴 ↾ ran 𝐵) = ∅)
9 relrn0 5966 . . . 4 (Rel (𝐴 ↾ ran 𝐵) → ((𝐴 ↾ ran 𝐵) = ∅ ↔ ran (𝐴 ↾ ran 𝐵) = ∅))
106, 9ax-mp 5 . . 3 ((𝐴 ↾ ran 𝐵) = ∅ ↔ ran (𝐴 ↾ ran 𝐵) = ∅)
11 dmres 6001 . . . . 5 dom (𝐴 ↾ ran 𝐵) = (ran 𝐵 ∩ dom 𝐴)
12 incom 4200 . . . . 5 (ran 𝐵 ∩ dom 𝐴) = (dom 𝐴 ∩ ran 𝐵)
1311, 12eqtri 2760 . . . 4 dom (𝐴 ↾ ran 𝐵) = (dom 𝐴 ∩ ran 𝐵)
1413eqeq1i 2737 . . 3 (dom (𝐴 ↾ ran 𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)
158, 10, 143bitr3i 300 . 2 (ran (𝐴 ↾ ran 𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)
163, 5, 153bitri 296 1 ((𝐴𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 205   = wceq 1541  cin 3946  c0 4321  dom cdm 5675  ran crn 5676  cres 5677  ccom 5679  Rel wrel 5680
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-br 5148  df-opab 5210  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687
This theorem is referenced by:  coemptyd  14922  diophrw  41482  relexpnul  42414
  Copyright terms: Public domain W3C validator