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

Theorem reldisjunOLD 6032
Description: Obsolete version of reldmun 6031 as of 20-Jun-2026. (Contributed by Thierry Arnoux, 9-Oct-2023.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
reldisjunOLD ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → 𝑅 = ((𝑅𝐴) ∪ (𝑅𝐵)))

Proof of Theorem reldisjunOLD
StepHypRef Expression
1 reseq2 5971 . . 3 (dom 𝑅 = (𝐴𝐵) → (𝑅 ↾ dom 𝑅) = (𝑅 ↾ (𝐴𝐵)))
213ad2ant2 1150 . 2 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → (𝑅 ↾ dom 𝑅) = (𝑅 ↾ (𝐴𝐵)))
3 resdm 6023 . . 3 (Rel 𝑅 → (𝑅 ↾ dom 𝑅) = 𝑅)
433ad2ant1 1149 . 2 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → (𝑅 ↾ dom 𝑅) = 𝑅)
5 resundi 5990 . . 3 (𝑅 ↾ (𝐴𝐵)) = ((𝑅𝐴) ∪ (𝑅𝐵))
65a1i 11 . 2 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → (𝑅 ↾ (𝐴𝐵)) = ((𝑅𝐴) ∪ (𝑅𝐵)))
72, 4, 63eqtr3d 2812 1 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → 𝑅 = ((𝑅𝐴) ∪ (𝑅𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1101   = wceq 1567  cun 3911  cin 3912  c0 4294  dom cdm 5659  cres 5661  Rel wrel 5664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5258  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5111  df-opab 5175  df-xp 5665  df-rel 5666  df-dm 5669  df-res 5671
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator