| 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 6516 | . 2 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦) | |
| 2 | orc 868 | . . . 4 ⊢ (𝑥𝐹𝑦 → (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦)) | |
| 3 | brun 5151 | . . . 4 ⊢ (𝑥(𝐹 ∪ 𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦)) | |
| 4 | 2, 3 | sylibr 234 | . . 3 ⊢ (𝑥𝐹𝑦 → 𝑥(𝐹 ∪ 𝐺)𝑦) |
| 5 | 4 | moimi 2546 | . 2 ⊢ (∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦 → ∃*𝑦 𝑥𝐹𝑦) |
| 6 | 1, 5 | syl 17 | 1 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 848 ∃*wmo 2538 ∪ cun 3901 class class class wbr 5100 Fun wfun 6494 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2540 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-fun 6502 |
| This theorem is referenced by: fununfun 6548 |
| Copyright terms: Public domain | W3C validator |