Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elmapresaun | Structured version Visualization version GIF version |
Description: fresaun 6629 transposed to mappings. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Stefan O'Rear, 6-May-2015.) |
Ref | Expression |
---|---|
elmapresaun | ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵) ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → (𝐹 ∪ 𝐺) ∈ (𝐶 ↑m (𝐴 ∪ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elmapi 8595 | . . 3 ⊢ (𝐹 ∈ (𝐶 ↑m 𝐴) → 𝐹:𝐴⟶𝐶) | |
2 | elmapi 8595 | . . 3 ⊢ (𝐺 ∈ (𝐶 ↑m 𝐵) → 𝐺:𝐵⟶𝐶) | |
3 | id 22 | . . 3 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵)) → (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) | |
4 | fresaun 6629 | . . 3 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) | |
5 | 1, 2, 3, 4 | syl3an 1158 | . 2 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵) ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
6 | elmapex 8594 | . . . . 5 ⊢ (𝐹 ∈ (𝐶 ↑m 𝐴) → (𝐶 ∈ V ∧ 𝐴 ∈ V)) | |
7 | 6 | simpld 494 | . . . 4 ⊢ (𝐹 ∈ (𝐶 ↑m 𝐴) → 𝐶 ∈ V) |
8 | 7 | 3ad2ant1 1131 | . . 3 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵) ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → 𝐶 ∈ V) |
9 | 6 | simprd 495 | . . . . 5 ⊢ (𝐹 ∈ (𝐶 ↑m 𝐴) → 𝐴 ∈ V) |
10 | elmapex 8594 | . . . . . 6 ⊢ (𝐺 ∈ (𝐶 ↑m 𝐵) → (𝐶 ∈ V ∧ 𝐵 ∈ V)) | |
11 | 10 | simprd 495 | . . . . 5 ⊢ (𝐺 ∈ (𝐶 ↑m 𝐵) → 𝐵 ∈ V) |
12 | unexg 7577 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V) | |
13 | 9, 11, 12 | syl2an 595 | . . . 4 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵)) → (𝐴 ∪ 𝐵) ∈ V) |
14 | 13 | 3adant3 1130 | . . 3 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵) ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → (𝐴 ∪ 𝐵) ∈ V) |
15 | 8, 14 | elmapd 8587 | . 2 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵) ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐹 ∪ 𝐺) ∈ (𝐶 ↑m (𝐴 ∪ 𝐵)) ↔ (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶)) |
16 | 5, 15 | mpbird 256 | 1 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐴) ∧ 𝐺 ∈ (𝐶 ↑m 𝐵) ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → (𝐹 ∪ 𝐺) ∈ (𝐶 ↑m (𝐴 ∪ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∪ cun 3881 ∩ cin 3882 ↾ cres 5582 ⟶wf 6414 (class class class)co 7255 ↑m cmap 8573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-map 8575 |
This theorem is referenced by: satfv1lem 33224 diophin 40510 eldioph4b 40549 diophren 40551 |
Copyright terms: Public domain | W3C validator |