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

Theorem cocan1 5688
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 5492 . . . . . 6 ((𝐻:𝐴𝐵𝑥𝐴) → ((𝐹𝐻)‘𝑥) = (𝐹‘(𝐻𝑥)))
213ad2antl2 1144 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → ((𝐹𝐻)‘𝑥) = (𝐹‘(𝐻𝑥)))
3 fvco3 5492 . . . . . 6 ((𝐾:𝐴𝐵𝑥𝐴) → ((𝐹𝐾)‘𝑥) = (𝐹‘(𝐾𝑥)))
433ad2antl3 1145 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → ((𝐹𝐾)‘𝑥) = (𝐹‘(𝐾𝑥)))
52, 4eqeq12d 2154 . . . 4 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥) ↔ (𝐹‘(𝐻𝑥)) = (𝐹‘(𝐾𝑥))))
6 simpl1 984 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → 𝐹:𝐵1-1𝐶)
7 ffvelrn 5553 . . . . . 6 ((𝐻:𝐴𝐵𝑥𝐴) → (𝐻𝑥) ∈ 𝐵)
873ad2antl2 1144 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (𝐻𝑥) ∈ 𝐵)
9 ffvelrn 5553 . . . . . 6 ((𝐾:𝐴𝐵𝑥𝐴) → (𝐾𝑥) ∈ 𝐵)
1093ad2antl3 1145 . . . . 5 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (𝐾𝑥) ∈ 𝐵)
11 f1fveq 5673 . . . . 5 ((𝐹:𝐵1-1𝐶 ∧ ((𝐻𝑥) ∈ 𝐵 ∧ (𝐾𝑥) ∈ 𝐵)) → ((𝐹‘(𝐻𝑥)) = (𝐹‘(𝐾𝑥)) ↔ (𝐻𝑥) = (𝐾𝑥)))
126, 8, 10, 11syl12anc 1214 . . . 4 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → ((𝐹‘(𝐻𝑥)) = (𝐹‘(𝐾𝑥)) ↔ (𝐻𝑥) = (𝐾𝑥)))
135, 12bitrd 187 . . 3 (((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) ∧ 𝑥𝐴) → (((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥) ↔ (𝐻𝑥) = (𝐾𝑥)))
1413ralbidva 2433 . 2 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (∀𝑥𝐴 ((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥) ↔ ∀𝑥𝐴 (𝐻𝑥) = (𝐾𝑥)))
15 f1f 5328 . . . . . 6 (𝐹:𝐵1-1𝐶𝐹:𝐵𝐶)
16153ad2ant1 1002 . . . . 5 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐹:𝐵𝐶)
17 ffn 5272 . . . . 5 (𝐹:𝐵𝐶𝐹 Fn 𝐵)
1816, 17syl 14 . . . 4 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐹 Fn 𝐵)
19 simp2 982 . . . 4 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐻:𝐴𝐵)
20 fnfco 5297 . . . 4 ((𝐹 Fn 𝐵𝐻:𝐴𝐵) → (𝐹𝐻) Fn 𝐴)
2118, 19, 20syl2anc 408 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (𝐹𝐻) Fn 𝐴)
22 simp3 983 . . . 4 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐾:𝐴𝐵)
23 fnfco 5297 . . . 4 ((𝐹 Fn 𝐵𝐾:𝐴𝐵) → (𝐹𝐾) Fn 𝐴)
2418, 22, 23syl2anc 408 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (𝐹𝐾) Fn 𝐴)
25 eqfnfv 5518 . . 3 (((𝐹𝐻) Fn 𝐴 ∧ (𝐹𝐾) Fn 𝐴) → ((𝐹𝐻) = (𝐹𝐾) ↔ ∀𝑥𝐴 ((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥)))
2621, 24, 25syl2anc 408 . 2 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → ((𝐹𝐻) = (𝐹𝐾) ↔ ∀𝑥𝐴 ((𝐹𝐻)‘𝑥) = ((𝐹𝐾)‘𝑥)))
27 ffn 5272 . . . 4 (𝐻:𝐴𝐵𝐻 Fn 𝐴)
2819, 27syl 14 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐻 Fn 𝐴)
29 ffn 5272 . . . 4 (𝐾:𝐴𝐵𝐾 Fn 𝐴)
3022, 29syl 14 . . 3 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → 𝐾 Fn 𝐴)
31 eqfnfv 5518 . . 3 ((𝐻 Fn 𝐴𝐾 Fn 𝐴) → (𝐻 = 𝐾 ↔ ∀𝑥𝐴 (𝐻𝑥) = (𝐾𝑥)))
3228, 30, 31syl2anc 408 . 2 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → (𝐻 = 𝐾 ↔ ∀𝑥𝐴 (𝐻𝑥) = (𝐾𝑥)))
3314, 26, 323bitr4d 219 1 ((𝐹:𝐵1-1𝐶𝐻:𝐴𝐵𝐾:𝐴𝐵) → ((𝐹𝐻) = (𝐹𝐾) ↔ 𝐻 = 𝐾))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 962   = wceq 1331  wcel 1480  wral 2416  ccom 4543   Fn wfn 5118  wf 5119  1-1wf1 5120  cfv 5123
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fv 5131
This theorem is referenced by:  mapen  6740  hashfacen  10579
  Copyright terms: Public domain W3C validator