Theorem fununmo 6583

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 6552	. 2 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦)
2		orc 880	. . . 4 ⊢ (𝑥𝐹𝑦 → (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦))
3		brun 5161	. . . 4 ⊢ (𝑥(𝐹 ∪ 𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦))
4	2, 3	sylibr 237	. . 3 ⊢ (𝑥𝐹𝑦 → 𝑥(𝐹 ∪ 𝐺)𝑦)
5	4	moimi 2572	. 2 ⊢ (∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦 → ∃*𝑦 𝑥𝐹𝑦)
6	1, 5	syl 18	1 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦)

This proof depends on syntax axioms:   → wi 4   ∨ wo 860  ∃*wmo 2564   ∪ cun 3902   class class class wbr 5108  Fun wfun 6530

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-mo 2566  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-fun 6538

This theorem is used by:  fununfun  6584