Theorem fnunres2 30422

Description: Restriction of a disjoint union to the domain of the second function. (Contributed by Thierry Arnoux, 12-Oct-2023.)

Assertion

Ref	Expression
fnunres2	⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺)

Proof of Theorem fnunres2

Step	Hyp	Ref	Expression
1		uncom 4122	. . 3 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹)
2	1	reseq1i 5842	. 2 ⊢ ((𝐹 ∪ 𝐺) ↾ 𝐵) = ((𝐺 ∪ 𝐹) ↾ 𝐵)
3		simp2 1132	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐺 Fn 𝐵)
4		simp1 1131	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹 Fn 𝐴)
5		incom 4171	. . . 4 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
6		simp3 1133	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∩ 𝐵) = ∅)
7	5, 6	syl5eqr 2869	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐵 ∩ 𝐴) = ∅)
8		fnunres1 30354	. . 3 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐵 ∩ 𝐴) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺)
9	3, 4, 7, 8	syl3anc 1366	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺)
10	2, 9	syl5eq 2867	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺)

Syntax hints:   → wi 4   ∧ w3a 1082   = wceq 1536   ∪ cun 3927   ∩ cin 3928  ∅c0 4284   ↾ cres 5550   Fn wfn 6343

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-br 5060  df-opab 5122  df-xp 5554  df-rel 5555  df-dm 5558  df-res 5560  df-fun 6350  df-fn 6351

This theorem is referenced by:  tocycfvres1  30771  cycpmconjslem2  30816