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 35227
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 7209 . 2 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)))
2 iman 401 . . . . . 6 (((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ ¬ 𝑥 = 𝑦))
3 df-ne 2933 . . . . . . 7 (𝑥𝑦 ↔ ¬ 𝑥 = 𝑦)
43anbi2i 624 . . . . . 6 (((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦) ↔ ((𝐹𝑥) = (𝐹𝑦) ∧ ¬ 𝑥 = 𝑦))
52, 4xchbinxr 335 . . . . 5 (((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
652ralbii 3112 . . . 4 (∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥𝐴𝑦𝐴 ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
7 ralnex2 3117 . . . 4 (∀𝑥𝐴𝑦𝐴 ¬ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦) ↔ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
86, 7bitri 275 . . 3 (∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦) ↔ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦))
98anbi2i 624 . 2 ((𝐹:𝐴𝐵 ∧ ∀𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦)) ↔ (𝐹:𝐴𝐵 ∧ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦)))
101, 9bitri 275 1 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ ¬ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1542  wne 2932  wral 3051  wrex 3061  wf 6494  1-1wf1 6495  cfv 6498
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fv 6506
This theorem is referenced by:  umgracycusgr  35336
  Copyright terms: Public domain W3C validator