Theorem fununmo 6401

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 6371	. 2 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦)
2		orc 863	. . . 4 ⊢ (𝑥𝐹𝑦 → (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦))
3		brun 5117	. . . 4 ⊢ (𝑥(𝐹 ∪ 𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∨ 𝑥𝐺𝑦))
4	2, 3	sylibr 236	. . 3 ⊢ (𝑥𝐹𝑦 → 𝑥(𝐹 ∪ 𝐺)𝑦)
5	4	moimi 2627	. 2 ⊢ (∃*𝑦 𝑥(𝐹 ∪ 𝐺)𝑦 → ∃*𝑦 𝑥𝐹𝑦)
6	1, 5	syl 17	1 ⊢ (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦)

Syntax hints:   → wi 4   ∨ wo 843  ∃*wmo 2620   ∪ cun 3934   class class class wbr 5066  Fun wfun 6349

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-fun 6357

This theorem is referenced by:  fununfun  6402