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 36053

Description: A ring homomorphism preserves 1. (Contributed by Jeff Madsen, 24-Jun-2011.)

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

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

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

Step	Hyp	Ref	Expression
1		eqid 2738	. . . . 5 ⊢ (1^st ‘𝑅) = (1^st ‘𝑅)
2		rnghom1.1	. . . . 5 ⊢ 𝐻 = (2^nd ‘𝑅)
3		eqid 2738	. . . . 5 ⊢ ran (1^st ‘𝑅) = ran (1^st ‘𝑅)
4		rnghom1.2	. . . . 5 ⊢ 𝑈 = (GId‘𝐻)
5		eqid 2738	. . . . 5 ⊢ (1^st ‘𝑆) = (1^st ‘𝑆)
6		rnghom1.3	. . . . 5 ⊢ 𝐾 = (2^nd ‘𝑆)
7		eqid 2738	. . . . 5 ⊢ ran (1^st ‘𝑆) = ran (1^st ‘𝑆)
8		rnghom1.4	. . . . 5 ⊢ 𝑉 = (GId‘𝐾)
9	1, 2, 3, 4, 5, 6, 7, 8	isrngohom 36050	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ (𝐹:ran (1^st ‘𝑅)⟶ran (1^st ‘𝑆) ∧ (𝐹‘𝑈) = 𝑉 ∧ ∀𝑥 ∈ ran (1^st ‘𝑅)∀𝑦 ∈ ran (1^st ‘𝑅)((𝐹‘(𝑥(1^st ‘𝑅)𝑦)) = ((𝐹‘𝑥)(1^st ‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥𝐻𝑦)) = ((𝐹‘𝑥)𝐾(𝐹‘𝑦))))))
10	9	biimpa 476	. . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → (𝐹:ran (1^st ‘𝑅)⟶ran (1^st ‘𝑆) ∧ (𝐹‘𝑈) = 𝑉 ∧ ∀𝑥 ∈ ran (1^st ‘𝑅)∀𝑦 ∈ ran (1^st ‘𝑅)((𝐹‘(𝑥(1^st ‘𝑅)𝑦)) = ((𝐹‘𝑥)(1^st ‘𝑆)(𝐹‘𝑦)) ∧ (𝐹‘(𝑥𝐻𝑦)) = ((𝐹‘𝑥)𝐾(𝐹‘𝑦)))))
11	10	simp2d 1141	. 2 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → (𝐹‘𝑈) = 𝑉)
12	11	3impa 1108	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → (𝐹‘𝑈) = 𝑉)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ran crn 5581 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 1^st c1st 7802 2^nd c2nd 7803 GIdcgi 28753 RingOpscrngo 35979 RngHom crnghom 36045

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-map 8575 df-rngohom 36048

This theorem is referenced by: rngohomco 36059 rngoisocnv 36066

W3C validator