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

Theorem reldisjunOLD 6017
Description: Obsolete version of reldmun 6016 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 5956 . . 3 (dom 𝑅 = (𝐴𝐵) → (𝑅 ↾ dom 𝑅) = (𝑅 ↾ (𝐴𝐵)))
213ad2ant2 1146 . 2 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → (𝑅 ↾ dom 𝑅) = (𝑅 ↾ (𝐴𝐵)))
3 resdm 6008 . . 3 (Rel 𝑅 → (𝑅 ↾ dom 𝑅) = 𝑅)
433ad2ant1 1145 . 2 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → (𝑅 ↾ dom 𝑅) = 𝑅)
5 resundi 5975 . . 3 (𝑅 ↾ (𝐴𝐵)) = ((𝑅𝐴) ∪ (𝑅𝐵))
65a1i 11 . 2 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → (𝑅 ↾ (𝐴𝐵)) = ((𝑅𝐴) ∪ (𝑅𝐵)))
72, 4, 63eqtr3d 2804 1 ((Rel 𝑅 ∧ dom 𝑅 = (𝐴𝐵) ∧ (𝐴𝐵) = ∅) → 𝑅 = ((𝑅𝐴) ∪ (𝑅𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1097   = wceq 1559  cun 3900  cin 3901  c0 4283  dom cdm 5643  cres 5645  Rel wrel 5648
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-xp 5649  df-rel 5650  df-dm 5653  df-res 5655
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator