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

Theorem coeq0 6107
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 6099 and coundir 6100 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 6096 . . 3 Rel (𝐴𝐵)
2 relrn0 5839 . . 3 (Rel (𝐴𝐵) → ((𝐴𝐵) = ∅ ↔ ran (𝐴𝐵) = ∅))
31, 2ax-mp 5 . 2 ((𝐴𝐵) = ∅ ↔ ran (𝐴𝐵) = ∅)
4 rnco 6104 . . 3 ran (𝐴𝐵) = ran (𝐴 ↾ ran 𝐵)
54eqeq1i 2826 . 2 (ran (𝐴𝐵) = ∅ ↔ ran (𝐴 ↾ ran 𝐵) = ∅)
6 relres 5881 . . . 4 Rel (𝐴 ↾ ran 𝐵)
7 reldm0 5797 . . . 4 (Rel (𝐴 ↾ ran 𝐵) → ((𝐴 ↾ ran 𝐵) = ∅ ↔ dom (𝐴 ↾ ran 𝐵) = ∅))
86, 7ax-mp 5 . . 3 ((𝐴 ↾ ran 𝐵) = ∅ ↔ dom (𝐴 ↾ ran 𝐵) = ∅)
9 relrn0 5839 . . . 4 (Rel (𝐴 ↾ ran 𝐵) → ((𝐴 ↾ ran 𝐵) = ∅ ↔ ran (𝐴 ↾ ran 𝐵) = ∅))
106, 9ax-mp 5 . . 3 ((𝐴 ↾ ran 𝐵) = ∅ ↔ ran (𝐴 ↾ ran 𝐵) = ∅)
11 dmres 5874 . . . . 5 dom (𝐴 ↾ ran 𝐵) = (ran 𝐵 ∩ dom 𝐴)
12 incom 4177 . . . . 5 (ran 𝐵 ∩ dom 𝐴) = (dom 𝐴 ∩ ran 𝐵)
1311, 12eqtri 2844 . . . 4 dom (𝐴 ↾ ran 𝐵) = (dom 𝐴 ∩ ran 𝐵)
1413eqeq1i 2826 . . 3 (dom (𝐴 ↾ ran 𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)
158, 10, 143bitr3i 303 . 2 (ran (𝐴 ↾ ran 𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)
163, 5, 153bitri 299 1 ((𝐴𝐵) = ∅ ↔ (dom 𝐴 ∩ ran 𝐵) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 208   = wceq 1533  cin 3934  c0 4290  dom cdm 5554  ran crn 5555  cres 5556  ccom 5558  Rel wrel 5559
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 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-br 5066  df-opab 5128  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566
This theorem is referenced by:  coemptyd  14338  diophrw  39354  relexpnul  40021
  Copyright terms: Public domain W3C validator