| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rngohomf | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem, use rhmf 20563 instead. A ring homomorphism is a function. (Contributed by Jeff Madsen, 19-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| rnghomf.1 | ⊢ 𝐺 = (1st ‘𝑅) |
| rnghomf.2 | ⊢ 𝑋 = ran 𝐺 |
| rnghomf.3 | ⊢ 𝐽 = (1st ‘𝑆) |
| rnghomf.4 | ⊢ 𝑌 = ran 𝐽 |
| Ref | Expression |
|---|---|
| rngohomf | ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:𝑋⟶𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnghomf.1 | . . . . 5 ⊢ 𝐺 = (1st ‘𝑅) | |
| 2 | eqid 2763 | . . . . 5 ⊢ (2nd ‘𝑅) = (2nd ‘𝑅) | |
| 3 | rnghomf.2 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
| 4 | eqid 2763 | . . . . 5 ⊢ (GId‘(2nd ‘𝑅)) = (GId‘(2nd ‘𝑅)) | |
| 5 | rnghomf.3 | . . . . 5 ⊢ 𝐽 = (1st ‘𝑆) | |
| 6 | eqid 2763 | . . . . 5 ⊢ (2nd ‘𝑆) = (2nd ‘𝑆) | |
| 7 | rnghomf.4 | . . . . 5 ⊢ 𝑌 = ran 𝐽 | |
| 8 | eqid 2763 | . . . . 5 ⊢ (GId‘(2nd ‘𝑆)) = (GId‘(2nd ‘𝑆)) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | isrngohom 38636 | . . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝑅 RingOpsHom 𝑆) ↔ (𝐹:𝑋⟶𝑌 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦)))))) |
| 10 | 9 | biimpa 481 | . . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹:𝑋⟶𝑌 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))))) |
| 11 | 10 | simp1d 1160 | . 2 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:𝑋⟶𝑌) |
| 12 | 11 | 3impa 1127 | 1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:𝑋⟶𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ran crn 5662 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 1st c1st 7980 2nd c2nd 7981 GIdcgi 30842 RingOpscrngo 38565 RingOpsHom crngohom 38631 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-map 8822 df-rngohom 38634 |
| This theorem is referenced by: rngohomcl 38638 rngogrphom 38642 rngohomco 38645 keridl 38703 |
| Copyright terms: Public domain | W3C validator |