MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fununfunOLD Structured version   Visualization version   GIF version

Theorem fununfunOLD 6617
Description: Obsolete version of fununfun 6616 as of 24-Oct-2026. (Contributed by AV, 18-Jul-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
fununfunOLD (Fun (𝐹 ∪ 𝐺) → (Fun 𝐹 ∧ Fun 𝐺))

Proof of Theorem fununfunOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 funrel 6584 . . 3 (Fun (𝐹 ∪ 𝐺) → Rel (𝐹 ∪ 𝐺))
2 relun 5798 . . 3 (Rel (𝐹 ∪ 𝐺) ↔ (Rel 𝐹 ∧ Rel 𝐺))
31, 2sylib 221 . 2 (Fun (𝐹 ∪ 𝐺) → (Rel 𝐹 ∧ Rel 𝐺))
4 simpl 488 . . . . 5 ((Rel 𝐹 ∧ Rel 𝐺) → Rel 𝐹)
5 fununmo 6615 . . . . . 6 (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐹𝑦)
65alrimiv 1962 . . . . 5 (Fun (𝐹 ∪ 𝐺) → ∀𝑥∃*𝑦 𝑥𝐹𝑦)
74, 6anim12i 625 . . . 4 (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦))
8 dffun6 6577 . . . 4 (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦))
97, 8sylibr 237 . . 3 (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → Fun 𝐹)
10 simpr 490 . . . . 5 ((Rel 𝐹 ∧ Rel 𝐺) → Rel 𝐺)
11 uncom 4160 . . . . . . . 8 (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹)
1211funeqi 6588 . . . . . . 7 (Fun (𝐹 ∪ 𝐺) ↔ Fun (𝐺 ∪ 𝐹))
13 fununmo 6615 . . . . . . 7 (Fun (𝐺 ∪ 𝐹) → ∃*𝑦 𝑥𝐺𝑦)
1412, 13sylbi 220 . . . . . 6 (Fun (𝐹 ∪ 𝐺) → ∃*𝑦 𝑥𝐺𝑦)
1514alrimiv 1962 . . . . 5 (Fun (𝐹 ∪ 𝐺) → ∀𝑥∃*𝑦 𝑥𝐺𝑦)
1610, 15anim12i 625 . . . 4 (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Rel 𝐺 ∧ ∀𝑥∃*𝑦 𝑥𝐺𝑦))
17 dffun6 6577 . . . 4 (Fun 𝐺 ↔ (Rel 𝐺 ∧ ∀𝑥∃*𝑦 𝑥𝐺𝑦))
1816, 17sylibr 237 . . 3 (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → Fun 𝐺)
199, 18jca 521 . 2 (((Rel 𝐹 ∧ Rel 𝐺) ∧ Fun (𝐹 ∪ 𝐺)) → (Fun 𝐹 ∧ Fun 𝐺))
203, 19mpancom 701 1 (Fun (𝐹 ∪ 𝐺) → (Fun 𝐹 ∧ Fun 𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568  ∃*wmo 2565   ∪ cun 4152   class class class wbr 5108  Rel wrel 5663  Fun wfun 6560
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-fun 6568
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator