Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  disjresdisj Structured version   Visualization version   GIF version

Theorem disjresdisj 39322
Description: The intersection of restrictions to disjoint is the empty class. (Contributed by Peter Mazsa, 24-Jul-2024.)
Assertion
Ref Expression
disjresdisj ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ 𝐴) ∩ (𝑅 ↾ 𝐵)) = ∅)

Proof of Theorem disjresdisj
StepHypRef Expression
1 resindi 5991 . 2 (𝑅 ↾ (𝐴 ∩ 𝐵)) = ((𝑅 ↾ 𝐴) ∩ (𝑅 ↾ 𝐵))
2 disjresin 39321 . 2 ((𝐴 ∩ 𝐵) = ∅ → (𝑅 ↾ (𝐴 ∩ 𝐵)) = ∅)
31, 2eqtr3id 2812 1 ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ 𝐴) ∩ (𝑅 ↾ 𝐵)) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∩ cin 4092  ∅c0 4281   ↾ cres 5657
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-opab 5171  df-xp 5661  df-rel 5662  df-res 5667
This theorem is used by:  disjresdif  39323
  Copyright terms: Public domain W3C validator