Theorem disjresundif 38995

Description: Lemma for ressucdifsn2 39236. (Contributed by Peter Mazsa, 24-Jul-2024.)

Assertion

Ref	Expression
disjresundif	⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ (𝐴 ∪ 𝐵)) ∖ (𝑅 ↾ 𝐵)) = (𝑅 ↾ 𝐴))

Proof of Theorem disjresundif

Step	Hyp	Ref	Expression
1		resundi 5986	. . . 4 ⊢ (𝑅 ↾ (𝐴 ∪ 𝐵)) = ((𝑅 ↾ 𝐴) ∪ (𝑅 ↾ 𝐵))
2	1	difeq1i 4070	. . 3 ⊢ ((𝑅 ↾ (𝐴 ∪ 𝐵)) ∖ (𝑅 ↾ 𝐵)) = (((𝑅 ↾ 𝐴) ∪ (𝑅 ↾ 𝐵)) ∖ (𝑅 ↾ 𝐵))
3		difun2 4437	. . 3 ⊢ (((𝑅 ↾ 𝐴) ∪ (𝑅 ↾ 𝐵)) ∖ (𝑅 ↾ 𝐵)) = ((𝑅 ↾ 𝐴) ∖ (𝑅 ↾ 𝐵))
4	2, 3	eqtri 2783	. 2 ⊢ ((𝑅 ↾ (𝐴 ∪ 𝐵)) ∖ (𝑅 ↾ 𝐵)) = ((𝑅 ↾ 𝐴) ∖ (𝑅 ↾ 𝐵))
5		disjresdif 38994	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ 𝐴) ∖ (𝑅 ↾ 𝐵)) = (𝑅 ↾ 𝐴))
6	4, 5	eqtrid 2807	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ (𝐴 ∪ 𝐵)) ∖ (𝑅 ↾ 𝐵)) = (𝑅 ↾ 𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898  ∅c0 4279   ↾ cres 5657

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5661  df-rel 5662  df-res 5667

This theorem is used by:  ressucdifsn2  39236