ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cocan1 GIF version

Theorem cocan1 5993
Description: An injection is left-cancelable. (Contributed by FL, 2-Aug-2009.) (Revised by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
cocan1 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → ((𝐹𝐻) = (𝐹𝐾) ↔ 𝐻 = 𝐾))

Proof of Theorem cocan1
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fvco3 5776 . . . . . 6 ((𝐻:𝐴𝐵𝑥𝐴) → ((𝐹𝐻)‘𝑥) = (𝐹‘(𝐻𝑥)))
213ad2antl2 1191 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → ((𝐹𝐻)‘𝑥) = (𝐹‘(𝐻𝑥)))
3 fvco3 5776 . . . . . 6 ((𝐾:𝐴𝐵𝑥𝐴) → ((𝐹𝐾)‘𝑥) = (𝐹‘(𝐾𝑥)))
433ad2antl3 1192 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → ((𝐹𝐾)‘𝑥) = (𝐹‘(𝐾𝑥)))
52, 4eqeq12d 2253 . . . 4 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥) ↔ (𝐹‘(𝐻𝑥)) = (𝐹‘(𝐾𝑥))))
6 simpl1 1031 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → 𝐹:𝐵1-1𝐶)
7 ffvelcdm 5841 . . . . . 6 ((𝐻:𝐴𝐵𝑥𝐴) → (𝐻𝑥) ∈ 𝐵)
873ad2antl2 1191 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (𝐻𝑥) ∈ 𝐵)
9 ffvelcdm 5841 . . . . . 6 ((𝐾:𝐴𝐵𝑥𝐴) → (𝐾𝑥) ∈ 𝐵)
1093ad2antl3 1192 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (𝐾𝑥) ∈ 𝐵)
11 f1fveq 5978 . . . . 5 ((𝐹:𝐵1-1𝐶 ∧ ((𝐻𝑥) ∈ 𝐵 ∧ (𝐾𝑥) ∈ 𝐵)) → ((𝐹‘(𝐻𝑥)) = (𝐹‘(𝐾𝑥)) ↔ (𝐻𝑥) = (𝐾𝑥)))
126, 8, 10, 11syl12anc 1276 . . . 4 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → ((𝐹‘(𝐻𝑥)) = (𝐹‘(𝐾𝑥)) ↔ (𝐻𝑥) = (𝐾𝑥)))
135, 12bitrd 188 . . 3 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥) ↔ (𝐻𝑥) = (𝐾𝑥)))
1413ralbidva 2546 . 2 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (∀𝑥𝐴 ((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥) ↔ ∀𝑥𝐴 (𝐻𝑥) = (𝐾𝑥)))
15 f1f 5598 . . . . . 6 (𝐹:𝐵1-1𝐶𝐹:𝐵𝐶)
16153ad2ant1 1049 . . . . 5 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐹:𝐵𝐶)
17 ffn 5533 . . . . 5 (𝐹:𝐵𝐶𝐹 Fn 𝐵)
1816, 17syl 14 . . . 4 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐹 Fn 𝐵)
19 simp2 1029 . . . 4 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐻:𝐴𝐵)
20 fnfco 5564 . . . 4 ((𝐹 Fn 𝐵𝐻:𝐴𝐵) → (𝐹𝐻) Fn 𝐴)
2118, 19, 20syl2anc 415 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (𝐹𝐻) Fn 𝐴)
22 simp3 1030 . . . 4 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐾:𝐴𝐵)
23 fnfco 5564 . . . 4 ((𝐹 Fn 𝐵𝐾:𝐴𝐵) → (𝐹𝐾) Fn 𝐴)
2418, 22, 23syl2anc 415 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (𝐹𝐾) Fn 𝐴)
25 eqfnfv 5806 . . 3 (((𝐹𝐻) Fn 𝐴 ∧ (𝐹𝐾) Fn 𝐴) → ((𝐹𝐻) = (𝐹𝐾) ↔ ∀𝑥𝐴 ((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥)))
2621, 24, 25syl2anc 415 . 2 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → ((𝐹𝐻) = (𝐹𝐾) ↔ ∀𝑥𝐴 ((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥)))
27 ffn 5533 . . . 4 (𝐻:𝐴𝐵𝐻 Fn 𝐴)
2819, 27syl 14 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐻 Fn 𝐴)
29 ffn 5533 . . . 4 (𝐾:𝐴𝐵𝐾 Fn 𝐴)
3022, 29syl 14 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐾 Fn 𝐴)
31 eqfnfv 5806 . . 3 ((𝐻 Fn 𝐴𝐾 Fn 𝐴) → (𝐻 = 𝐾 ↔ ∀𝑥𝐴 (𝐻𝑥) = (𝐾𝑥)))
3228, 30, 31syl2anc 415 . 2 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (𝐻 = 𝐾 ↔ ∀𝑥𝐴 (𝐻𝑥) = (𝐾𝑥)))
3314, 26, 323bitr4d 220 1 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → ((𝐹𝐻) = (𝐹𝐾) ↔ 𝐻 = 𝐾))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  wral 2528  ccom 4778   Fn wfn 5372  wf 5373  1-1wf1 5374  cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fv 5385
This theorem is used by:  mapen  7146  hashfacen  11284
  Copyright terms: Public domain W3C validator