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

Theorem f1ovscpbl 17748
Description: An injection is compatible with any operations on the base set. (Contributed by Mario Carneiro, 15-Aug-2015.)
Hypothesis
Ref Expression
f1ocpbl.f (𝜑 → 𝐹:𝑉⟶1-1onto𝑋)
Assertion
Ref Expression
f1ovscpbl ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶))))

Proof of Theorem f1ovscpbl
StepHypRef Expression
1 f1ocpbl.f . . . . 5 (𝜑 → 𝐹:𝑉⟶1-1onto𝑋)
2 f1of1 6853 . . . . 5 (𝐹:𝑉⟶1-1onto𝑋 → 𝐹:𝑉⟶1-1𝑋)
31, 2syl 18 . . . 4 (𝜑 → 𝐹:𝑉⟶1-1𝑋)
43adantr 486 . . 3 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐹:𝑉⟶1-1𝑋)
5 simpr2 1214 . . 3 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉)
6 simpr3 1215 . . 3 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉)
7 f1fveq 7297 . . 3 ((𝐹:𝑉⟶1-1𝑋 ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) ↔ 𝐵 = 𝐶))
84, 5, 6, 7syl12anc 850 . 2 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) ↔ 𝐵 = 𝐶))
9 oveq2 7459 . . 3 (𝐵 = 𝐶 → (𝐴 + 𝐵) = (𝐴 + 𝐶))
109fveq2d 6920 . 2 (𝐵 = 𝐶 → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶)))
118, 10biimtrdi 256 1 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-f1o 6573  df-fv 6574  df-ov 7454
This theorem is used by:  xpsvsca  17799
  Copyright terms: Public domain W3C validator