| 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 6564 | . . 3 ⊢ (Fun (𝐹 ∪ 𝐺) → Rel (𝐹 ∪ 𝐺)) | |
| 2 | relun 5793 | . . 3 ⊢ (Rel (𝐹 ∪ 𝐺) ↔ (Rel 𝐹 ∧ Rel 𝐺)) | |
| 3 | 1, 2 | sylib 221 | . 2 ⊢ (Fun (𝐹 ∪ 𝐺) → (Rel 𝐹 ∧ Rel 𝐺)) |
| 4 | simpl 488 | . . . . 5 ⊢ ((Rel 𝐹 ∧ Rel 𝐺) → Rel 𝐹) | |
| 5 | fununmo 6595 | . . . . . 6 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦) | |
| 6 | 5 | alrimiv 1961 | . . . . 5 ⊢ (Fun (𝐹 ∪ 𝐺) → ∀𝑥∃*𝑦 𝑥𝐹𝑦) |
| 7 | 4, 6 | anim12i 625 | . . . 4 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
| 8 | dffun6 6557 | . . . 4 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) | |
| 9 | 7, 8 | sylibr 237 | . . 3 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → Fun 𝐹) |
| 10 | simpr 490 | . . . . 5 ⊢ ((Rel 𝐹 ∧ Rel 𝐺) → Rel 𝐺) | |
| 11 | uncom 4159 | . . . . . . . 8 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹) | |
| 12 | 11 | funeqi 6568 | . . . . . . 7 ⊢ (Fun (𝐹 ∪ 𝐺) ↔ Fun (𝐺 ∪ 𝐹)) |
| 13 | fununmo 6595 | . . . . . . 7 ⊢ (Fun (𝐺 ∪ 𝐹) → ∃*𝑦 𝑥𝐺𝑦) | |
| 14 | 12, 13 | sylbi 220 | . . . . . 6 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐺𝑦) |
| 15 | 14 | alrimiv 1961 | . . . . 5 ⊢ (Fun (𝐹 ∪ 𝐺) → ∀𝑥∃*𝑦 𝑥𝐺𝑦) |
| 16 | 10, 15 | anim12i 625 | . . . 4 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Rel 𝐺 ∧ ∀𝑥∃*𝑦 𝑥𝐺𝑦)) |
| 17 | dffun6 6557 | . . . 4 ⊢ (Fun 𝐺 ↔ (Rel 𝐺 ∧ ∀𝑥∃*𝑦 𝑥𝐺𝑦)) | |
| 18 | 16, 17 | sylibr 237 | . . 3 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → Fun 𝐺) |
| 19 | 9, 18 | jca 521 | . 2 ⊢ (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Fun 𝐹 ∧ Fun 𝐺)) |
| 20 | 3, 19 | mpancom 701 | 1 ⊢ (Fun (𝐹 ∪ 𝐺) → (Fun 𝐹 ∧ Fun 𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1567 ∃*wmo 2565 ∪ cun 4151 class class class wbr 5105 Rel wrel 5659 Fun wfun 6540 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-br 5106 df-opab 5170 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-fun 6548 |
| This theorem is used by: fsuppunbi 9391 |
| Copyright terms: Public domain | W3C validator |