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

Theorem fununiq 32005
Description: The uniqueness condition of functions. (Contributed by Scott Fenton, 18-Feb-2013.)
Hypotheses
Ref Expression
fununiq.1 𝐴 ∈ V
fununiq.2 𝐵 ∈ V
fununiq.3 𝐶 ∈ V
Assertion
Ref Expression
fununiq (Fun 𝐹 → ((𝐴𝐹𝐵𝐴𝐹𝐶) → 𝐵 = 𝐶))

Proof of Theorem fununiq
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dffun2 6041 . 2 (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥𝑦𝑧((𝑥𝐹𝑦𝑥𝐹𝑧) → 𝑦 = 𝑧)))
2 fununiq.1 . . . 4 𝐴 ∈ V
3 fununiq.2 . . . 4 𝐵 ∈ V
4 fununiq.3 . . . 4 𝐶 ∈ V
5 breq12 4791 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥𝐹𝑦𝐴𝐹𝐵))
653adant3 1126 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝑥𝐹𝑦𝐴𝐹𝐵))
7 breq12 4791 . . . . . . . 8 ((𝑥 = 𝐴𝑧 = 𝐶) → (𝑥𝐹𝑧𝐴𝐹𝐶))
873adant2 1125 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝑥𝐹𝑧𝐴𝐹𝐶))
96, 8anbi12d 616 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ((𝑥𝐹𝑦𝑥𝐹𝑧) ↔ (𝐴𝐹𝐵𝐴𝐹𝐶)))
10 eqeq12 2784 . . . . . . 7 ((𝑦 = 𝐵𝑧 = 𝐶) → (𝑦 = 𝑧𝐵 = 𝐶))
11103adant1 1124 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝑦 = 𝑧𝐵 = 𝐶))
129, 11imbi12d 333 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (((𝑥𝐹𝑦𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝐴𝐹𝐵𝐴𝐹𝐶) → 𝐵 = 𝐶)))
1312spc3gv 3449 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (∀𝑥𝑦𝑧((𝑥𝐹𝑦𝑥𝐹𝑧) → 𝑦 = 𝑧) → ((𝐴𝐹𝐵𝐴𝐹𝐶) → 𝐵 = 𝐶)))
142, 3, 4, 13mp3an 1572 . . 3 (∀𝑥𝑦𝑧((𝑥𝐹𝑦𝑥𝐹𝑧) → 𝑦 = 𝑧) → ((𝐴𝐹𝐵𝐴𝐹𝐶) → 𝐵 = 𝐶))
1514adantl 467 . 2 ((Rel 𝐹 ∧ ∀𝑥𝑦𝑧((𝑥𝐹𝑦𝑥𝐹𝑧) → 𝑦 = 𝑧)) → ((𝐴𝐹𝐵𝐴𝐹𝐶) → 𝐵 = 𝐶))
161, 15sylbi 207 1 (Fun 𝐹 → ((𝐴𝐹𝐵𝐴𝐹𝐶) → 𝐵 = 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  w3a 1071  wal 1629   = wceq 1631  wcel 2145  Vcvv 3351   class class class wbr 4786  Rel wrel 5254  Fun wfun 6025
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rab 3070  df-v 3353  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-br 4787  df-opab 4847  df-id 5157  df-cnv 5257  df-co 5258  df-fun 6033
This theorem is referenced by:  funbreq  32006
  Copyright terms: Public domain W3C validator