| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isghmd | GIF version | ||
| Description: Deduction for a group homomorphism. (Contributed by Stefan O'Rear, 4-Feb-2015.) |
| Ref | Expression |
|---|---|
| isghmd.x | ⊢ 𝑋 = (Base‘𝑆) |
| isghmd.y | ⊢ 𝑌 = (Base‘𝑇) |
| isghmd.a | ⊢ + = (+g‘𝑆) |
| isghmd.b | ⊢ ⨣ = (+g‘𝑇) |
| isghmd.s | ⊢ (𝜑 → 𝑆 ∈ Grp) |
| isghmd.t | ⊢ (𝜑 → 𝑇 ∈ Grp) |
| isghmd.f | ⊢ (𝜑 → 𝐹:𝑋⟶𝑌) |
| isghmd.l | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
| Ref | Expression |
|---|---|
| isghmd | ⊢ (𝜑 → 𝐹 ∈ (𝑆 GrpHom 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isghmd.s | . 2 ⊢ (𝜑 → 𝑆 ∈ Grp) | |
| 2 | isghmd.t | . 2 ⊢ (𝜑 → 𝑇 ∈ Grp) | |
| 3 | isghmd.f | . . 3 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌) | |
| 4 | isghmd.l | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) | |
| 5 | 4 | ralrimivva 2632 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
| 6 | 3, 5 | jca 306 | . 2 ⊢ (𝜑 → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))) |
| 7 | isghmd.x | . . 3 ⊢ 𝑋 = (Base‘𝑆) | |
| 8 | isghmd.y | . . 3 ⊢ 𝑌 = (Base‘𝑇) | |
| 9 | isghmd.a | . . 3 ⊢ + = (+g‘𝑆) | |
| 10 | isghmd.b | . . 3 ⊢ ⨣ = (+g‘𝑇) | |
| 11 | 7, 8, 9, 10 | isghm 14048 | . 2 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))) |
| 12 | 1, 2, 6, 11 | syl21anbrc 1213 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝑆 GrpHom 𝑇)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ⟶wf 5373 ‘cfv 5377 (class class class)co 6085 Basecbs 13354 +gcplusg 13433 Grpcgrp 13807 GrpHom cghm 14045 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-inn 9306 df-ndx 13357 df-slot 13358 df-base 13360 df-ghm 14046 |
| This theorem is used by: ghmmhmb 14059 resghm 14065 conjghm 14081 qusghm 14087 ghmfghm 14132 invghm 14135 ringlghm 14368 ringrghm 14369 isrhmd 14475 asclghm 15027 |
| Copyright terms: Public domain | W3C validator |