Metamath Proof Explorer


Theorem fun

Description: The union of two functions with disjoint domains. (Contributed by NM, 22-Sep-2004)

Ref Expression
Assertion fun ( ( ( 𝐹 : 𝐴𝐶𝐺 : 𝐵𝐷 ) ∧ ( 𝐴𝐵 ) = ∅ ) → ( 𝐹𝐺 ) : ( 𝐴𝐵 ) ⟶ ( 𝐶𝐷 ) )

Proof

Step Hyp Ref Expression
1 fnun ( ( ( 𝐹 Fn 𝐴𝐺 Fn 𝐵 ) ∧ ( 𝐴𝐵 ) = ∅ ) → ( 𝐹𝐺 ) Fn ( 𝐴𝐵 ) )
2 1 expcom ( ( 𝐴𝐵 ) = ∅ → ( ( 𝐹 Fn 𝐴𝐺 Fn 𝐵 ) → ( 𝐹𝐺 ) Fn ( 𝐴𝐵 ) ) )
3 rnun ran ( 𝐹𝐺 ) = ( ran 𝐹 ∪ ran 𝐺 )
4 unss12 ( ( ran 𝐹𝐶 ∧ ran 𝐺𝐷 ) → ( ran 𝐹 ∪ ran 𝐺 ) ⊆ ( 𝐶𝐷 ) )
5 3 4 eqsstrid ( ( ran 𝐹𝐶 ∧ ran 𝐺𝐷 ) → ran ( 𝐹𝐺 ) ⊆ ( 𝐶𝐷 ) )
6 2 5 anim12d1 ( ( 𝐴𝐵 ) = ∅ → ( ( ( 𝐹 Fn 𝐴𝐺 Fn 𝐵 ) ∧ ( ran 𝐹𝐶 ∧ ran 𝐺𝐷 ) ) → ( ( 𝐹𝐺 ) Fn ( 𝐴𝐵 ) ∧ ran ( 𝐹𝐺 ) ⊆ ( 𝐶𝐷 ) ) ) )
7 df-f ( 𝐹 : 𝐴𝐶 ↔ ( 𝐹 Fn 𝐴 ∧ ran 𝐹𝐶 ) )
8 df-f ( 𝐺 : 𝐵𝐷 ↔ ( 𝐺 Fn 𝐵 ∧ ran 𝐺𝐷 ) )
9 7 8 anbi12i ( ( 𝐹 : 𝐴𝐶𝐺 : 𝐵𝐷 ) ↔ ( ( 𝐹 Fn 𝐴 ∧ ran 𝐹𝐶 ) ∧ ( 𝐺 Fn 𝐵 ∧ ran 𝐺𝐷 ) ) )
10 an4 ( ( ( 𝐹 Fn 𝐴 ∧ ran 𝐹𝐶 ) ∧ ( 𝐺 Fn 𝐵 ∧ ran 𝐺𝐷 ) ) ↔ ( ( 𝐹 Fn 𝐴𝐺 Fn 𝐵 ) ∧ ( ran 𝐹𝐶 ∧ ran 𝐺𝐷 ) ) )
11 9 10 bitri ( ( 𝐹 : 𝐴𝐶𝐺 : 𝐵𝐷 ) ↔ ( ( 𝐹 Fn 𝐴𝐺 Fn 𝐵 ) ∧ ( ran 𝐹𝐶 ∧ ran 𝐺𝐷 ) ) )
12 df-f ( ( 𝐹𝐺 ) : ( 𝐴𝐵 ) ⟶ ( 𝐶𝐷 ) ↔ ( ( 𝐹𝐺 ) Fn ( 𝐴𝐵 ) ∧ ran ( 𝐹𝐺 ) ⊆ ( 𝐶𝐷 ) ) )
13 6 11 12 3imtr4g ( ( 𝐴𝐵 ) = ∅ → ( ( 𝐹 : 𝐴𝐶𝐺 : 𝐵𝐷 ) → ( 𝐹𝐺 ) : ( 𝐴𝐵 ) ⟶ ( 𝐶𝐷 ) ) )
14 13 impcom ( ( ( 𝐹 : 𝐴𝐶𝐺 : 𝐵𝐷 ) ∧ ( 𝐴𝐵 ) = ∅ ) → ( 𝐹𝐺 ) : ( 𝐴𝐵 ) ⟶ ( 𝐶𝐷 ) )