rngohom1 - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > rngohom1		Structured version Visualization version GIF version

Theorem rngohom1 38902

Description: Obsolete theorem, use rhm1 20724 instead. A ring homomorphism preserves 1. (Contributed by Jeff Madsen, 24-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
rnghom1.1	⊢ 𝐻 = (2^nd ‘𝑅)
rnghom1.2	⊢ 𝑈 = (GId‘𝐻)
rnghom1.3	⊢ 𝐾 = (2^nd ‘𝑆)
rnghom1.4	⊢ 𝑉 = (GId‘𝐾)

**Assertion**
Ref	Expression
rngohom1	⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹‘𝑈) = 𝑉)

Proof of Theorem rngohom1 Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2761	. . . . 5 ⊢ (1^st ‘𝑅) = (1^st ‘𝑅)
2		rnghom1.1	. . . . 5 ⊢ 𝐻 = (2^nd ‘𝑅)
3		eqid 2761	. . . . 5 ⊢ ran (1^st ‘𝑅) = ran (1^st ‘𝑅)
4		rnghom1.2	. . . . 5 ⊢ 𝑈 = (GId‘𝐻)
5		eqid 2761	. . . . 5 ⊢ (1^st ‘𝑆) = (1^st ‘𝑆)
6		rnghom1.3	. . . . 5 ⊢ 𝐾 = (2^nd ‘𝑆)
7		eqid 2761	. . . . 5 ⊢ ran (1^st ‘𝑆) = ran (1^st ‘𝑆)
8		rnghom1.4	. . . . 5 ⊢ 𝑉 = (GId‘𝐾)
9	1, 2, 3, 4, 5, 6, 7, 8	isrngohom 38899	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝑅 RingOpsHom 𝑆) ↔ (𝐹:ran (1^st ‘𝑅)⟶ran (1^st ‘𝑆) ∧ (𝐹‘𝑈) = 𝑉 ∧ ∀𝑥 ∈ ran (1^st ‘𝑅)∀𝑦 ∈ ran (1^st ‘𝑅)((𝐹‘(𝑥(1^st ‘𝑅)𝑦)) = ((𝐹‘𝑥)(1^st ‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥𝐻𝑦)) = ((𝐹‘𝑥)𝐾(𝐹‘𝑦))))))
10	9	biimpa 482	. . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹:ran (1^st ‘𝑅)⟶ran (1^st ‘𝑆) ∧ (𝐹‘𝑈) = 𝑉 ∧ ∀𝑥 ∈ ran (1^st ‘𝑅)∀𝑦 ∈ ran (1^st ‘𝑅)((𝐹‘(𝑥(1^st ‘𝑅)𝑦)) = ((𝐹‘𝑥)(1^st ‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥𝐻𝑦)) = ((𝐹‘𝑥)𝐾(𝐹‘𝑦)))))
11	10	simp2d 1161	. 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 1570 ∈ wcel 2145 ∀wral 3077 ran crn 5652 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 1^st c1st 7999 2^nd c2nd 8000 GIdcgi 31092 RingOpscrngo 38828 RingOpsHom crngohom 38894

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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 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-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-map 8849 df-rngohom 38897

This theorem is used by: rngohomco 38908 rngoisocnv 38915

W3C validator