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

Theorem dffo5 6873
Description: Alternate definition of an onto mapping. (Contributed by NM, 20-Mar-2007.)
Assertion
Ref Expression
dffo5 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦

Proof of Theorem dffo5
StepHypRef Expression
1 dffo4 6872 . 2 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦))
2 rexex 3243 . . . . 5 (∃𝑥𝐴 𝑥𝐹𝑦 → ∃𝑥 𝑥𝐹𝑦)
32ralimi 3163 . . . 4 (∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦 → ∀𝑦𝐵𝑥 𝑥𝐹𝑦)
43anim2i 618 . . 3 ((𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦) → (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
5 ffn 6517 . . . . . . . . 9 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
6 fnbr 6462 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑥𝐹𝑦) → 𝑥𝐴)
76ex 415 . . . . . . . . 9 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦𝑥𝐴))
85, 7syl 17 . . . . . . . 8 (𝐹:𝐴𝐵 → (𝑥𝐹𝑦𝑥𝐴))
98ancrd 554 . . . . . . 7 (𝐹:𝐴𝐵 → (𝑥𝐹𝑦 → (𝑥𝐴𝑥𝐹𝑦)))
109eximdv 1917 . . . . . 6 (𝐹:𝐴𝐵 → (∃𝑥 𝑥𝐹𝑦 → ∃𝑥(𝑥𝐴𝑥𝐹𝑦)))
11 df-rex 3147 . . . . . 6 (∃𝑥𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
1210, 11syl6ibr 254 . . . . 5 (𝐹:𝐴𝐵 → (∃𝑥 𝑥𝐹𝑦 → ∃𝑥𝐴 𝑥𝐹𝑦))
1312ralimdv 3181 . . . 4 (𝐹:𝐴𝐵 → (∀𝑦𝐵𝑥 𝑥𝐹𝑦 → ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦))
1413imdistani 571 . . 3 ((𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦) → (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦))
154, 14impbii 211 . 2 ((𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
161, 15bitri 277 1 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wex 1779  wcel 2113  wral 3141  wrex 3142   class class class wbr 5069   Fn wfn 6353  wf 6354  ontowfo 6356
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-fo 6364  df-fv 6366
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator