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

Theorem fununiq 6578
Description: Functions are single-valued. (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 6571 . 2 (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑥𝐹𝑧) → 𝑦 = 𝑧)))
2 fununiq.1 . . 3 𝐴 ∈ V
3 fununiq.2 . . 3 𝐵 ∈ V
4 fununiq.3 . . 3 𝐶 ∈ V
5 breq12 5111 . . . . . . 7 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝐵))
653adant3 1150 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝐵))
7 breq12 5111 . . . . . . 7 ((𝑥 = 𝐴 ∧ 𝑧 = 𝐶) → (𝑥𝐹𝑧 ↔ 𝐴𝐹𝐶))
873adant2 1149 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥𝐹𝑧 ↔ 𝐴𝐹𝐶))
96, 8anbi12d 644 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥𝐹𝑦 ∧ 𝑥𝐹𝑧) ↔ (𝐴𝐹𝐵 ∧ 𝐴𝐹𝐶)))
10 eqeq12 2780 . . . . . 6 ((𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦 = 𝑧 ↔ 𝐵 = 𝐶))
11103adant1 1148 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦 = 𝑧 ↔ 𝐵 = 𝐶))
129, 11imbi12d 347 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (((𝑥𝐹𝑦 ∧ 𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝐴𝐹𝐵 ∧ 𝐴𝐹𝐶) → 𝐵 = 𝐶)))
1312spc3gv 3562 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑥𝐹𝑧) → 𝑦 = 𝑧) → ((𝐴𝐹𝐵 ∧ 𝐴𝐹𝐶) → 𝐵 = 𝐶)))
142, 3, 4, 13mp3an 1491 . 2 (∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑥𝐹𝑧) → 𝑦 = 𝑧) → ((𝐴𝐹𝐵 ∧ 𝐴𝐹𝐶) → 𝐵 = 𝐶))
151, 14simplbiim 514 1 (Fun 𝐹 → ((𝐴𝐹𝐵 ∧ 𝐴𝐹𝐶) → 𝐵 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454   class class class wbr 5106  Rel wrel 5661  Fun wfun 6555
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-fun 6563
This theorem is used by:  funbreq  36725  cocanss2  46125
  Copyright terms: Public domain W3C validator