| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fununmo | Structured version Visualization version GIF version | ||
| Description: If the union of classes is a function, there is at most one element in relation to an arbitrary element regarding one of these classes. (Contributed by AV, 18-Jul-2019.) |
| Ref | Expression |
|---|---|
| fununmo | ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funmo 6556 | . 2 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦) | |
| 2 | orc 867 | . . . 4 ⊢ (𝑥𝐹𝑦 → (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦)) | |
| 3 | brun 5175 | . . . 4 ⊢ (𝑥(𝐹 ∪ 𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦)) | |
| 4 | 2, 3 | sylibr 234 | . . 3 ⊢ (𝑥𝐹𝑦 → 𝑥(𝐹 ∪ 𝐺)𝑦) |
| 5 | 4 | moimi 2545 | . 2 ⊢ (∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦 → ∃*𝑦 𝑥𝐹𝑦) |
| 6 | 1, 5 | syl 17 | 1 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 847 ∃*wmo 2538 ∪ cun 3929 class class class wbr 5124 Fun wfun 6530 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-mo 2540 df-clab 2715 df-cleq 2728 df-clel 2810 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-br 5125 df-opab 5187 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-fun 6538 |
| This theorem is referenced by: fununfun 6589 |
| Copyright terms: Public domain | W3C validator |