| 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 20730 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 39042 | . . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝑅 RingOpsHom 𝑆) ↔ (𝐹:𝑋⟶𝑌 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦)))))) |
| 10 | 9 | biimpa 482 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ∀wral 3080 ran crn 5656 ⟶wf 6543 ‘cfv 6547 (class class class)co 7430 1st c1st 8009 2nd c2nd 8010 GIdcgi 31107 RingOpscrngo 38971 RingOpsHom crngohom 39037 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-fv 6555 df-ov 7433 df-oprab 7434 df-mpo 7435 df-map 8863 df-rngohom 39040 |
| This theorem is used by: rngohomcl 39044 rngogrphom 39048 rngohomco 39051 keridl 39109 |
| Copyright terms: Public domain | W3C validator |