ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dffo5 GIF version

Theorem dffo5 5826
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 5825 . 2 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦))
2 rexex 2588 . . . . 5 (∃𝑥𝐴 𝑥𝐹𝑦 → ∃𝑥 𝑥𝐹𝑦)
32ralimi 2605 . . . 4 (∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦 → ∀𝑦𝐵𝑥 𝑥𝐹𝑦)
43anim2i 342 . . 3 ((𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦) → (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
5 ffn 5508 . . . . . . . . 9 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
6 fnbr 5460 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑥𝐹𝑦) → 𝑥𝐴)
76ex 115 . . . . . . . . 9 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦𝑥𝐴))
85, 7syl 14 . . . . . . . 8 (𝐹:𝐴𝐵 → (𝑥𝐹𝑦𝑥𝐴))
98ancrd 326 . . . . . . 7 (𝐹:𝐴𝐵 → (𝑥𝐹𝑦 → (𝑥𝐴𝑥𝐹𝑦)))
109eximdv 1929 . . . . . 6 (𝐹:𝐴𝐵 → (∃𝑥 𝑥𝐹𝑦 → ∃𝑥(𝑥𝐴𝑥𝐹𝑦)))
11 df-rex 2526 . . . . . 6 (∃𝑥𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
1210, 11imbitrrdi 162 . . . . 5 (𝐹:𝐴𝐵 → (∃𝑥 𝑥𝐹𝑦 → ∃𝑥𝐴 𝑥𝐹𝑦))
1312ralimdv 2610 . . . 4 (𝐹:𝐴𝐵 → (∀𝑦𝐵𝑥 𝑥𝐹𝑦 → ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦))
1413imdistani 445 . . 3 ((𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦) → (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦))
154, 14impbii 126 . 2 ((𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑥𝐹𝑦) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
161, 15bitri 184 1 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥 𝑥𝐹𝑦))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wex 1541  wcel 2203  wral 2520  wrex 2521   class class class wbr 4109   Fn wfn 5347  wf 5348  ontowfo 5350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fo 5358  df-fv 5360
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator