HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem f1fveq 2918
Description: Equality of function values for a one-to-one function.
Assertion
Ref Expression
f1fveq ((F:A1-1B ∧ (CADA)) → ((FC) = (FD) ↔ C = D))

Proof of Theorem f1fveq
StepHypRef Expression
1 fveq2 2832 . . . . . . . 8 (x = C → (Fx) = (FC))
21cleq1d 1109 . . . . . . 7 (x = C → ((Fx) = (Fy) ↔ (FC) = (Fy)))
3 cleq1 1107 . . . . . . 7 (x = C → (x = yC = y))
42, 3imbi12d 474 . . . . . 6 (x = C → (((Fx) = (Fy) → x = y) ↔ ((FC) = (Fy) → C = y)))
54imbi2d 464 . . . . 5 (x = C → ((F:A1-1B → ((Fx) = (Fy) → x = y)) ↔ (F:A1-1B → ((FC) = (Fy) → C = y))))
6 fveq2 2832 . . . . . . . 8 (y = D → (Fy) = (FD))
76cleq2d 1112 . . . . . . 7 (y = D → ((FC) = (Fy) ↔ (FC) = (FD)))
8 cleq2 1110 . . . . . . 7 (y = D → (C = yC = D))
97, 8imbi12d 474 . . . . . 6 (y = D → (((FC) = (Fy) → C = y) ↔ ((FC) = (FD) → C = D)))
109imbi2d 464 . . . . 5 (y = D → ((F:A1-1B → ((FC) = (Fy) → C = y)) ↔ (F:A1-1B → ((FC) = (FD) → C = D))))
11 f1fv 2916 . . . . . . . 8 (F:A1-1B ↔ (F:A–→B ∧ ∀xAyA ((Fx) = (Fy) → x = y)))
1211pm3.27bd 263 . . . . . . 7 (F:A1-1B → ∀xAyA ((Fx) = (Fy) → x = y))
13 ra42 1245 . . . . . . 7 (∀xAyA ((Fx) = (Fy) → x = y) → ((xAyA) → ((Fx) = (Fy) → x = y)))
1412, 13syl 12 . . . . . 6 (F:A1-1B → ((xAyA) → ((Fx) = (Fy) → x = y)))
1514com12 13 . . . . 5 ((xAyA) → (F:A1-1B → ((Fx) = (Fy) → x = y)))
165, 10, 15vtocl2ga 1388 . . . 4 ((CADA) → (F:A1-1B → ((FC) = (FD) → C = D)))
1716com12 13 . . 3 (F:A1-1B → ((CADA) → ((FC) = (FD) → C = D)))
1817imp 277 . 2 ((F:A1-1B ∧ (CADA)) → ((FC) = (FD) → C = D))
19 fveq2 2832 . . 3 (C = D → (FC) = (FD))
2019a1i 7 . 2 ((F:A1-1B ∧ (CADA)) → (C = D → (FC) = (FD)))
2118, 20impbid 397 1 ((F:A1-1B ∧ (CADA)) → ((FC) = (FD) ↔ C = D))
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127   ∧ wa 196   = weq 797   = wceq 1091   ∈ wcel 1092  ∀wral 1201  –→wf 2418  –1-1wf1 2419   ‘cfv 2422
This theorem is referenced by:  isowe 2941  f1oiso 2942  f1oweOLD 2944  2dom 3332  xpdom2 3345  mapenlem2 3385
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fv 2438
metamath.org