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

Theorem f1ovscpbl 17707
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-1-onto→𝑋)
Assertion
Ref Expression
f1ovscpbl ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶))))

Proof of Theorem f1ovscpbl
StepHypRef Expression
1 f1ocpbl.f . . . . 5 (𝜑 → 𝐹:𝑉–1-1-onto→𝑋)
2 f1of1 6828 . . . . 5 (𝐹:𝑉–1-1-onto→𝑋 → 𝐹:𝑉–1-1→𝑋)
31, 2syl 18 . . . 4 (𝜑 → 𝐹:𝑉–1-1→𝑋)
43adantr 486 . . 3 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐹:𝑉–1-1→𝑋)
5 simpr2 1214 . . 3 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉)
6 simpr3 1215 . . 3 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉)
7 f1fveq 7270 . . 3 ((𝐹:𝑉–1-1→𝑋 ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) ↔ 𝐵 = 𝐶))
84, 5, 6, 7syl12anc 850 . 2 ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) ↔ 𝐵 = 𝐶))
9 oveq2 7432 . . 3 (𝐵 = 𝐶 → (𝐴 + 𝐵) = (𝐴 + 𝐶))
109fveq2d 6894 . 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 1569   ∈ wcel 2144  –1-1→wf1 6540  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7424
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-f1o 6550  df-fv 6551  df-ov 7427
This theorem is used by:  xpsvsca  17758
  Copyright terms: Public domain W3C validator