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

Theorem cocan2 6532
 Description: A surjection is right-cancelable. (Contributed by FL, 21-Nov-2011.) (Proof shortened by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
cocan2 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → ((𝐻𝐹) = (𝐾𝐹) ↔ 𝐻 = 𝐾))

Proof of Theorem cocan2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fof 6102 . . . . . . 7 (𝐹:𝐴onto𝐵𝐹:𝐴𝐵)
213ad2ant1 1080 . . . . . 6 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → 𝐹:𝐴𝐵)
3 fvco3 6262 . . . . . 6 ((𝐹:𝐴𝐵𝑦𝐴) → ((𝐻𝐹)‘𝑦) = (𝐻‘(𝐹𝑦)))
42, 3sylan 488 . . . . 5 (((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) ∧ 𝑦𝐴) → ((𝐻𝐹)‘𝑦) = (𝐻‘(𝐹𝑦)))
5 fvco3 6262 . . . . . 6 ((𝐹:𝐴𝐵𝑦𝐴) → ((𝐾𝐹)‘𝑦) = (𝐾‘(𝐹𝑦)))
62, 5sylan 488 . . . . 5 (((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) ∧ 𝑦𝐴) → ((𝐾𝐹)‘𝑦) = (𝐾‘(𝐹𝑦)))
74, 6eqeq12d 2635 . . . 4 (((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) ∧ 𝑦𝐴) → (((𝐻𝐹)‘𝑦) = ((𝐾𝐹)‘𝑦) ↔ (𝐻‘(𝐹𝑦)) = (𝐾‘(𝐹𝑦))))
87ralbidva 2982 . . 3 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → (∀𝑦𝐴 ((𝐻𝐹)‘𝑦) = ((𝐾𝐹)‘𝑦) ↔ ∀𝑦𝐴 (𝐻‘(𝐹𝑦)) = (𝐾‘(𝐹𝑦))))
9 fveq2 6178 . . . . . 6 ((𝐹𝑦) = 𝑥 → (𝐻‘(𝐹𝑦)) = (𝐻𝑥))
10 fveq2 6178 . . . . . 6 ((𝐹𝑦) = 𝑥 → (𝐾‘(𝐹𝑦)) = (𝐾𝑥))
119, 10eqeq12d 2635 . . . . 5 ((𝐹𝑦) = 𝑥 → ((𝐻‘(𝐹𝑦)) = (𝐾‘(𝐹𝑦)) ↔ (𝐻𝑥) = (𝐾𝑥)))
1211cbvfo 6529 . . . 4 (𝐹:𝐴onto𝐵 → (∀𝑦𝐴 (𝐻‘(𝐹𝑦)) = (𝐾‘(𝐹𝑦)) ↔ ∀𝑥𝐵 (𝐻𝑥) = (𝐾𝑥)))
13123ad2ant1 1080 . . 3 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → (∀𝑦𝐴 (𝐻‘(𝐹𝑦)) = (𝐾‘(𝐹𝑦)) ↔ ∀𝑥𝐵 (𝐻𝑥) = (𝐾𝑥)))
148, 13bitrd 268 . 2 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → (∀𝑦𝐴 ((𝐻𝐹)‘𝑦) = ((𝐾𝐹)‘𝑦) ↔ ∀𝑥𝐵 (𝐻𝑥) = (𝐾𝑥)))
15 simp2 1060 . . . 4 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → 𝐻 Fn 𝐵)
16 fnfco 6056 . . . 4 ((𝐻 Fn 𝐵𝐹:𝐴𝐵) → (𝐻𝐹) Fn 𝐴)
1715, 2, 16syl2anc 692 . . 3 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → (𝐻𝐹) Fn 𝐴)
18 simp3 1061 . . . 4 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → 𝐾 Fn 𝐵)
19 fnfco 6056 . . . 4 ((𝐾 Fn 𝐵𝐹:𝐴𝐵) → (𝐾𝐹) Fn 𝐴)
2018, 2, 19syl2anc 692 . . 3 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → (𝐾𝐹) Fn 𝐴)
21 eqfnfv 6297 . . 3 (((𝐻𝐹) Fn 𝐴 ∧ (𝐾𝐹) Fn 𝐴) → ((𝐻𝐹) = (𝐾𝐹) ↔ ∀𝑦𝐴 ((𝐻𝐹)‘𝑦) = ((𝐾𝐹)‘𝑦)))
2217, 20, 21syl2anc 692 . 2 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → ((𝐻𝐹) = (𝐾𝐹) ↔ ∀𝑦𝐴 ((𝐻𝐹)‘𝑦) = ((𝐾𝐹)‘𝑦)))
23 eqfnfv 6297 . . 3 ((𝐻 Fn 𝐵𝐾 Fn 𝐵) → (𝐻 = 𝐾 ↔ ∀𝑥𝐵 (𝐻𝑥) = (𝐾𝑥)))
2415, 18, 23syl2anc 692 . 2 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → (𝐻 = 𝐾 ↔ ∀𝑥𝐵 (𝐻𝑥) = (𝐾𝑥)))
2514, 22, 243bitr4d 300 1 ((𝐹:𝐴onto𝐵𝐻 Fn 𝐵𝐾 Fn 𝐵) → ((𝐻𝐹) = (𝐾𝐹) ↔ 𝐻 = 𝐾))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1481   ∈ wcel 1988  ∀wral 2909   ∘ ccom 5108   Fn wfn 5871  ⟶wf 5872  –onto→wfo 5874  ‘cfv 5876 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-mpt 4721  df-id 5014  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-fo 5882  df-fv 5884 This theorem is referenced by:  mapen  8109  mapfien  8298  hashfacen  13221  setcepi  16719  qtopeu  21500  qtophmeo  21601  fmptco1f1o  29407  derangenlem  31127
 Copyright terms: Public domain W3C validator