Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dff15 Structured version   Visualization version   GIF version

Theorem dff15 35060
Description: A one-to-one function in terms of different arguments never having the same function value. (Contributed by BTernaryTau, 24-Oct-2023.)
Assertion
Ref Expression
dff15 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑦)

Proof of Theorem dff15
StepHypRef Expression
1 dff13 7292 . 2 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
2 iman 401 . . . . . 6 (((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ ¬ 𝑥 = 𝑦))
3 df-ne 2947 . . . . . . 7 (𝑥𝑦 ↔ ¬ 𝑥 = 𝑦)
43anbi2i 622 . . . . . 6 (((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦) ↔ ((𝐹𝑥) = (𝐹𝑦) ∧ ¬ 𝑥 = 𝑦))
52, 4xchbinxr 335 . . . . 5 (((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
652ralbii 3134 . . . 4 (∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥𝐴𝑦𝐴 ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
7 ralnex2 3139 . . . 4 (∀𝑥𝐴𝑦𝐴 ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦) ↔ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
86, 7bitri 275 . . 3 (∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
98anbi2i 622 . 2 ((𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ↔ (𝐹:𝐴𝐵 ∧ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦)))
101, 9bitri 275 1 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wne 2946  wral 3067  wrex 3076  wf 6569  1-1wf1 6570  cfv 6573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fv 6581
This theorem is referenced by:  umgracycusgr  35122
  Copyright terms: Public domain W3C validator