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

Theorem dff1o6 7273
Description: A one-to-one onto function in terms of function values. (Contributed by NM, 29-Mar-2008.)
Assertion
Ref Expression
dff1o6 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦
Allowed substitution hints:   𝐵(𝑥, 𝑦)

Proof of Theorem dff1o6
StepHypRef Expression
1 df-f1o 6543 . 2 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹:𝐴1-1𝐵𝐹:𝐴onto𝐵))
2 dff13 7252 . . 3 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
3 df-fo 6542 . . 3 (𝐹:𝐴onto𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵))
42, 3anbi12i 639 . 2 ((𝐹:𝐴1-1𝐵𝐹:𝐴onto𝐵) ↔ ((𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)))
5 df-3an 1104 . . 3 ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
6 eqimss 3994 . . . . . . 7 (ran 𝐹 = 𝐵 → ran 𝐹𝐵)
76anim2i 628 . . . . . 6 ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
8 df-f 6540 . . . . . 6 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
97, 8sylibr 237 . . . . 5 ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) → 𝐹:𝐴𝐵)
109pm4.71ri 569 . . . 4 ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) ↔ (𝐹:𝐴𝐵 ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)))
1110anbi1i 635 . . 3 (((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ↔ ((𝐹:𝐴𝐵 ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
12 an32 658 . . 3 (((𝐹:𝐴𝐵 ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ↔ ((𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)))
135, 11, 123bitrri 301 . 2 (((𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
141, 4, 133bitri 300 1 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wral 3078  wss 3904  ran crn 5661   Fn wfn 6531  wf 6532  1-1wf1 6533  ontowfo 6534  1-1-ontowf1o 6535  cfv 6536
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-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  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-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  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-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544
This theorem is used by:  soisores  7325  f1otrg  29231  f1otrge  29232  grpoinvf  30895  bra11  32471  hgt750lemb  35052  diaf11N  41851  dibf11N  41963  lcfrlem9  42352  mapd1o  42450  hdmapf1oN  42667  hgmapf1oN  42705  rmxypairf1o  43666  onsucf1o  44027
  Copyright terms: Public domain W3C validator