Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fununfun | Structured version Visualization version GIF version |
Description: If the union of classes is a function, the classes itselves are functions. (Contributed by AV, 18-Jul-2019.) |
Ref | Expression |
---|---|
fununfun | ⊢ (Fun (𝐹 ∪ 𝐺) → (Fun 𝐹 ∧ Fun 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funrel 6435 | . . 3 ⊢ (Fun (𝐹 ∪ 𝐺) → Rel (𝐹 ∪ 𝐺)) | |
2 | relun 5710 | . . 3 ⊢ (Rel (𝐹 ∪ 𝐺) ↔ (Rel 𝐹 ∧ Rel 𝐺)) | |
3 | 1, 2 | sylib 217 | . 2 ⊢ (Fun (𝐹 ∪ 𝐺) → (Rel 𝐹 ∧ Rel 𝐺)) |
4 | simpl 482 | . . . . 5 ⊢ ((Rel 𝐹 ∧ Rel 𝐺) → Rel 𝐹) | |
5 | fununmo 6465 | . . . . . 6 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦) | |
6 | 5 | alrimiv 1931 | . . . . 5 ⊢ (Fun (𝐹 ∪ 𝐺) → ∀𝑥∃*𝑦 𝑥𝐹𝑦) |
7 | 4, 6 | anim12i 612 | . . . 4 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
8 | dffun6 6433 | . . . 4 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) | |
9 | 7, 8 | sylibr 233 | . . 3 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → Fun 𝐹) |
10 | simpr 484 | . . . . 5 ⊢ ((Rel 𝐹 ∧ Rel 𝐺) → Rel 𝐺) | |
11 | uncom 4083 | . . . . . . . 8 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹) | |
12 | 11 | funeqi 6439 | . . . . . . 7 ⊢ (Fun (𝐹 ∪ 𝐺) ↔ Fun (𝐺 ∪ 𝐹)) |
13 | fununmo 6465 | . . . . . . 7 ⊢ (Fun (𝐺 ∪ 𝐹) → ∃*𝑦 𝑥𝐺𝑦) | |
14 | 12, 13 | sylbi 216 | . . . . . 6 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐺𝑦) |
15 | 14 | alrimiv 1931 | . . . . 5 ⊢ (Fun (𝐹 ∪ 𝐺) → ∀𝑥∃*𝑦 𝑥𝐺𝑦) |
16 | 10, 15 | anim12i 612 | . . . 4 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Rel 𝐺 ∧ ∀𝑥∃*𝑦 𝑥𝐺𝑦)) |
17 | dffun6 6433 | . . . 4 ⊢ (Fun 𝐺 ↔ (Rel 𝐺 ∧ ∀𝑥∃*𝑦 𝑥𝐺𝑦)) | |
18 | 16, 17 | sylibr 233 | . . 3 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → Fun 𝐺) |
19 | 9, 18 | jca 511 | . 2 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Fun 𝐹 ∧ Fun 𝐺)) |
20 | 3, 19 | mpancom 684 | 1 ⊢ (Fun (𝐹 ∪ 𝐺) → (Fun 𝐹 ∧ Fun 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∀wal 1537 ∃*wmo 2538 ∪ cun 3881 class class class wbr 5070 Rel wrel 5585 Fun wfun 6412 |
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-pr 5347 |
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-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-fun 6420 |
This theorem is referenced by: fsuppunbi 9079 |
Copyright terms: Public domain | W3C validator |