| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rngohom0 | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem, use rhm0 20723 instead. A ring homomorphism preserves 0. (Contributed by Jeff Madsen, 2-Jan-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| rnghom0.1 | ⊢ 𝐺 = (1st ‘𝑅) |
| rnghom0.2 | ⊢ 𝑍 = (GId‘𝐺) |
| rnghom0.3 | ⊢ 𝐽 = (1st ‘𝑆) |
| rnghom0.4 | ⊢ 𝑊 = (GId‘𝐽) |
| Ref | Expression |
|---|---|
| rngohom0 | ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹‘𝑍) = 𝑊) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnghom0.1 | . . . 4 ⊢ 𝐺 = (1st ‘𝑅) | |
| 2 | 1 | rngogrpo 38845 | . . 3 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp) |
| 3 | 2 | 3ad2ant1 1151 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐺 ∈ GrpOp) |
| 4 | rnghom0.3 | . . . 4 ⊢ 𝐽 = (1st ‘𝑆) | |
| 5 | 4 | rngogrpo 38845 | . . 3 ⊢ (𝑆 ∈ RingOps → 𝐽 ∈ GrpOp) |
| 6 | 5 | 3ad2ant2 1152 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐽 ∈ GrpOp) |
| 7 | 1, 4 | rngogrphom 38906 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹 ∈ (𝐺 GrpOpHom 𝐽)) |
| 8 | rnghom0.2 | . . 3 ⊢ 𝑍 = (GId‘𝐺) | |
| 9 | rnghom0.4 | . . 3 ⊢ 𝑊 = (GId‘𝐽) | |
| 10 | 8, 9 | ghomidOLD 38824 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐽 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐽)) → (𝐹‘𝑍) = 𝑊) |
| 11 | 3, 6, 7, 10 | syl3anc 1398 | 1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹‘𝑍) = 𝑊) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ‘cfv 6538 (class class class)co 7420 1st c1st 7999 GrpOpcgr 31091 GIdcgi 31092 GrpOpHom cghomOLD 38818 RingOpscrngo 38829 RingOpsHom crngohom 38895 |
| 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-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| 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-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-map 8849 df-grpo 31095 df-gid 31096 df-ablo 31147 df-ghomOLD 38819 df-rngo 38830 df-rngohom 38898 |
| This theorem is used by: keridl 38967 |
| Copyright terms: Public domain | W3C validator |