Theorem fununmo 6590

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.)

Assertion

Ref	Expression
fununmo	⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦)

Distinct variable groups:   𝑥,𝑦   𝑦,𝐹   𝑦,𝐺

Allowed substitution hints:   𝐹(𝑥)   𝐺(𝑥)

Proof of Theorem fununmo

Step	Hyp	Ref	Expression
1		funmo 6559	. 2 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦)
2		orc 881	. . . 4 ⊢ (𝑥𝐹𝑦 → (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦))
3		brun 5167	. . . 4 ⊢ (𝑥(𝐹 ∪ 𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦))
4	2, 3	sylibr 237	. . 3 ⊢ (𝑥𝐹𝑦 → 𝑥(𝐹 ∪ 𝐺)𝑦)
5	4	moimi 2576	. 2 ⊢ (∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦 → ∃*𝑦 𝑥𝐹𝑦)
6	1, 5	syl 18	1 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦)

This proof depends on syntax axioms:   → wi 4   ∨ wo 861  ∃*wmo 2568   ∪ cun 3906   class class class wbr 5114  Fun wfun 6537

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2570  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-fun 6545

This theorem is used by:  fununfun  6591