| 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 20635 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 38661 | . . 3 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp) |
| 3 | 2 | 3ad2ant1 1151 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐺 ∈ GrpOp) |
| 4 | rnghom0.3 | . . . 4 ⊢ 𝐽 = (1st ‘𝑆) | |
| 5 | 4 | rngogrpo 38661 | . . 3 ⊢ (𝑆 ∈ RingOps → 𝐽 ∈ GrpOp) |
| 6 | 5 | 3ad2ant2 1152 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐽 ∈ GrpOp) |
| 7 | 1, 4 | rngogrphom 38722 | . 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹 ∈ (𝐺 GrpOpHom 𝐽)) |
| 8 | rnghom0.2 | . . 3 ⊢ 𝑍 = (GId‘𝐺) | |
| 9 | rnghom0.4 | . . 3 ⊢ 𝑊 = (GId‘𝐽) | |
| 10 | 8, 9 | ghomidOLD 38640 | . 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 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 1st c1st 7985 GrpOpcgr 30971 GIdcgi 30972 GrpOpHom cghomOLD 38634 RingOpscrngo 38645 RingOpsHom crngohom 38711 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| 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 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-map 8829 df-grpo 30975 df-gid 30976 df-ablo 31027 df-ghomOLD 38635 df-rngo 38646 df-rngohom 38714 |
| This theorem is used by: keridl 38783 |
| Copyright terms: Public domain | W3C validator |