![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > f1ovscpbl | GIF version |
Description: An injection is compatible with any operations on the base set. (Contributed by Mario Carneiro, 15-Aug-2015.) |
Ref | Expression |
---|---|
f1ocpbl.f | ⊢ (𝜑 → 𝐹:𝑉–1-1-onto→𝑋) |
Ref | Expression |
---|---|
f1ovscpbl | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1ocpbl.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝑉–1-1-onto→𝑋) | |
2 | f1of1 5461 | . . . . 5 ⊢ (𝐹:𝑉–1-1-onto→𝑋 → 𝐹:𝑉–1-1→𝑋) | |
3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐹:𝑉–1-1→𝑋) |
4 | 3 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐹:𝑉–1-1→𝑋) |
5 | simpr2 1004 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
6 | simpr3 1005 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
7 | f1fveq 5773 | . . 3 ⊢ ((𝐹:𝑉–1-1→𝑋 ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) ↔ 𝐵 = 𝐶)) | |
8 | 4, 5, 6, 7 | syl12anc 1236 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) ↔ 𝐵 = 𝐶)) |
9 | oveq2 5883 | . . 3 ⊢ (𝐵 = 𝐶 → (𝐴 + 𝐵) = (𝐴 + 𝐶)) | |
10 | 9 | fveq2d 5520 | . 2 ⊢ (𝐵 = 𝐶 → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶))) |
11 | 8, 10 | syl6bi 163 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐹‘𝐵) = (𝐹‘𝐶) → (𝐹‘(𝐴 + 𝐵)) = (𝐹‘(𝐴 + 𝐶)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 –1-1→wf1 5214 –1-1-onto→wf1o 5216 ‘cfv 5217 (class class class)co 5875 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4122 ax-pow 4175 ax-pr 4210 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2740 df-sbc 2964 df-un 3134 df-in 3136 df-ss 3143 df-pw 3578 df-sn 3599 df-pr 3600 df-op 3602 df-uni 3811 df-br 4005 df-opab 4066 df-id 4294 df-xp 4633 df-rel 4634 df-cnv 4635 df-co 4636 df-dm 4637 df-iota 5179 df-fun 5219 df-fn 5220 df-f 5221 df-f1 5222 df-f1o 5224 df-fv 5225 df-ov 5878 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |