![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fun | GIF version |
Description: The union of two functions with disjoint domains. (Contributed by NM, 22-Sep-2004.) |
Ref | Expression |
---|---|
fun | ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐷) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnun 5361 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐵)) | |
2 | 1 | expcom 116 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐵))) |
3 | rnun 5075 | . . . . . 6 ⊢ ran (𝐹 ∪ 𝐺) = (ran 𝐹 ∪ ran 𝐺) | |
4 | unss12 3332 | . . . . . 6 ⊢ ((ran 𝐹 ⊆ 𝐶 ∧ ran 𝐺 ⊆ 𝐷) → (ran 𝐹 ∪ ran 𝐺) ⊆ (𝐶 ∪ 𝐷)) | |
5 | 3, 4 | eqsstrid 3226 | . . . . 5 ⊢ ((ran 𝐹 ⊆ 𝐶 ∧ ran 𝐺 ⊆ 𝐷) → ran (𝐹 ∪ 𝐺) ⊆ (𝐶 ∪ 𝐷)) |
6 | 5 | a1i 9 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((ran 𝐹 ⊆ 𝐶 ∧ ran 𝐺 ⊆ 𝐷) → ran (𝐹 ∪ 𝐺) ⊆ (𝐶 ∪ 𝐷))) |
7 | 2, 6 | anim12d 335 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (ran 𝐹 ⊆ 𝐶 ∧ ran 𝐺 ⊆ 𝐷)) → ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐵) ∧ ran (𝐹 ∪ 𝐺) ⊆ (𝐶 ∪ 𝐷)))) |
8 | df-f 5259 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)) | |
9 | df-f 5259 | . . . . 5 ⊢ (𝐺:𝐵⟶𝐷 ↔ (𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐷)) | |
10 | 8, 9 | anbi12i 460 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐷) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶) ∧ (𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐷))) |
11 | an4 586 | . . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶) ∧ (𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐷)) ↔ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (ran 𝐹 ⊆ 𝐶 ∧ ran 𝐺 ⊆ 𝐷))) | |
12 | 10, 11 | bitri 184 | . . 3 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐷) ↔ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (ran 𝐹 ⊆ 𝐶 ∧ ran 𝐺 ⊆ 𝐷))) |
13 | df-f 5259 | . . 3 ⊢ ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐷) ↔ ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐵) ∧ ran (𝐹 ∪ 𝐺) ⊆ (𝐶 ∪ 𝐷))) | |
14 | 7, 12, 13 | 3imtr4g 205 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐷) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐷))) |
15 | 14 | impcom 125 | 1 ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐷) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∪ cun 3152 ∩ cin 3153 ⊆ wss 3154 ∅c0 3447 ran crn 4661 Fn wfn 5250 ⟶wf 5251 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-v 2762 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-br 4031 df-opab 4092 df-id 4325 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-fun 5257 df-fn 5258 df-f 5259 |
This theorem is referenced by: fun2 5428 ftpg 5743 fsnunf 5759 |
Copyright terms: Public domain | W3C validator |