Theorem fresaunres1disj 5537

Description: From the union of two functions with disjoint domains, either component can be recovered by restriction. (Contributed by Mario Carneiro, 16-Feb-2015.) (Revised by Jim Kingdon, 18-May-2026.)

Assertion

Ref	Expression
fresaunres1disj	⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹)

Proof of Theorem fresaunres1disj

Step	Hyp	Ref	Expression
1		fresaunres2disj 5536	. . 3 ⊢ ((𝐺:𝐵⟶𝐶 ∧ 𝐹:𝐴⟶𝐶 ∧ (𝐵 ∩ 𝐴) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹)
2	1	3com12 1234	. 2 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐵 ∩ 𝐴) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹)
3		incom 3410	. . . 4 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵)
4	3	eqeq1i 2240	. . 3 ⊢ ((𝐵 ∩ 𝐴) = ∅ ↔ (𝐴 ∩ 𝐵) = ∅)
5	4	3anbi3i 1219	. 2 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐵 ∩ 𝐴) = ∅) ↔ (𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐴 ∩ 𝐵) = ∅))
6		uncom 3362	. . . 4 ⊢ (𝐺 ∪ 𝐹) = (𝐹 ∪ 𝐺)
7	6	reseq1i 5025	. . 3 ⊢ ((𝐺 ∪ 𝐹) ↾ 𝐴) = ((𝐹 ∪ 𝐺) ↾ 𝐴)
8	7	eqeq1i 2240	. 2 ⊢ (((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹 ↔ ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹)
9	2, 5, 8	3imtr3i 200	1 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹)

Syntax hints:   → wi 4   ∧ w3a 1005   = wceq 1398   ∪ cun 3208   ∩ cin 3209  ∅c0 3505   ↾ cres 4742  ⟶wf 5339

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4221  ax-pow 4279  ax-pr 4314

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3506  df-pw 3667  df-sn 3688  df-pr 3689  df-op 3691  df-br 4103  df-opab 4165  df-xp 4746  df-rel 4747  df-dm 4750  df-res 4752  df-fun 5345  df-fn 5346  df-f 5347

This theorem is referenced by:  mapunen  7095