abvres - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > abvres		Structured version Visualization version GIF version

Theorem abvres 20447

Description: The restriction of an absolute value to a subring is an absolute value. (Contributed by Mario Carneiro, 4-Dec-2014.)

**Hypotheses**
Ref	Expression
abvres.a	⊢ 𝐴 = (AbsVal‘𝑅)
abvres.s	⊢ 𝑆 = (𝑅 ↾_s 𝐶)
abvres.b	⊢ 𝐵 = (AbsVal‘𝑆)

**Assertion**
Ref	Expression
abvres	⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (𝐹 ↾ 𝐶) ∈ 𝐵)

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

Step	Hyp	Ref	Expression
1		abvres.b	. . 3 ⊢ 𝐵 = (AbsVal‘𝑆)
2	1	a1i 11	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → 𝐵 = (AbsVal‘𝑆))
3		abvres.s	. . . 4 ⊢ 𝑆 = (𝑅 ↾_s 𝐶)
4	3	subrgbas 20328	. . 3 ⊢ (𝐶 ∈ (SubRing‘𝑅) → 𝐶 = (Base‘𝑆))
5	4	adantl 483	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → 𝐶 = (Base‘𝑆))
6		eqid 2733	. . . 4 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
7	3, 6	ressplusg 17235	. . 3 ⊢ (𝐶 ∈ (SubRing‘𝑅) → (+_g‘𝑅) = (+_g‘𝑆))
8	7	adantl 483	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (+_g‘𝑅) = (+_g‘𝑆))
9		eqid 2733	. . . 4 ⊢ (._r‘𝑅) = (._r‘𝑅)
10	3, 9	ressmulr 17252	. . 3 ⊢ (𝐶 ∈ (SubRing‘𝑅) → (._r‘𝑅) = (._r‘𝑆))
11	10	adantl 483	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (._r‘𝑅) = (._r‘𝑆))
12		subrgsubg 20325	. . . 4 ⊢ (𝐶 ∈ (SubRing‘𝑅) → 𝐶 ∈ (SubGrp‘𝑅))
13	12	adantl 483	. . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → 𝐶 ∈ (SubGrp‘𝑅))
14		eqid 2733	. . . 4 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
15	3, 14	subg0 19012	. . 3 ⊢ (𝐶 ∈ (SubGrp‘𝑅) → (0_g‘𝑅) = (0_g‘𝑆))
16	13, 15	syl 17	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (0_g‘𝑅) = (0_g‘𝑆))
17	3	subrgring 20322	. . 3 ⊢ (𝐶 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
18	17	adantl 483	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → 𝑆 ∈ Ring)
19		abvres.a	. . . 4 ⊢ 𝐴 = (AbsVal‘𝑅)
20		eqid 2733	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
21	19, 20	abvf 20431	. . 3 ⊢ (𝐹 ∈ 𝐴 → 𝐹:(Base‘𝑅)⟶ℝ)
22	20	subrgss 20320	. . 3 ⊢ (𝐶 ∈ (SubRing‘𝑅) → 𝐶 ⊆ (Base‘𝑅))
23		fssres 6758	. . 3 ⊢ ((𝐹:(Base‘𝑅)⟶ℝ ∧ 𝐶 ⊆ (Base‘𝑅)) → (𝐹 ↾ 𝐶):𝐶⟶ℝ)
24	21, 22, 23	syl2an 597	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (𝐹 ↾ 𝐶):𝐶⟶ℝ)
25	14	subg0cl 19014	. . . 4 ⊢ (𝐶 ∈ (SubGrp‘𝑅) → (0_g‘𝑅) ∈ 𝐶)
26		fvres 6911	. . . 4 ⊢ ((0_g‘𝑅) ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘(0_g‘𝑅)) = (𝐹‘(0_g‘𝑅)))
27	13, 25, 26	3syl 18	. . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → ((𝐹 ↾ 𝐶)‘(0_g‘𝑅)) = (𝐹‘(0_g‘𝑅)))
28	19, 14	abv0 20439	. . . 4 ⊢ (𝐹 ∈ 𝐴 → (𝐹‘(0_g‘𝑅)) = 0)
29	28	adantr 482	. . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (𝐹‘(0_g‘𝑅)) = 0)
30	27, 29	eqtrd 2773	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → ((𝐹 ↾ 𝐶)‘(0_g‘𝑅)) = 0)
31		simp1l 1198	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) → 𝐹 ∈ 𝐴)
32	22	adantl 483	. . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → 𝐶 ⊆ (Base‘𝑅))
33	32	sselda 3983	. . . . 5 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ (Base‘𝑅))
34	33	3adant3 1133	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) → 𝑥 ∈ (Base‘𝑅))
35		simp3 1139	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) → 𝑥 ≠ (0_g‘𝑅))
36	19, 20, 14	abvgt0 20436	. . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑥 ≠ (0_g‘𝑅)) → 0 < (𝐹‘𝑥))
37	31, 34, 35, 36	syl3anc 1372	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) → 0 < (𝐹‘𝑥))
38		fvres 6911	. . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥))
39	38	3ad2ant2 1135	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥))
40	37, 39	breqtrrd 5177	. 2 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ 𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) → 0 < ((𝐹 ↾ 𝐶)‘𝑥))
41		simp1l 1198	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝐹 ∈ 𝐴)
42		simp1r 1199	. . . . . 6 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝐶 ∈ (SubRing‘𝑅))
43	42, 22	syl 17	. . . . 5 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝐶 ⊆ (Base‘𝑅))
44		simp2l 1200	. . . . 5 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝑥 ∈ 𝐶)
45	43, 44	sseldd 3984	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝑥 ∈ (Base‘𝑅))
46		simp3l 1202	. . . . 5 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝑦 ∈ 𝐶)
47	43, 46	sseldd 3984	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → 𝑦 ∈ (Base‘𝑅))
48	19, 20, 9	abvmul 20437	. . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝐹‘(𝑥(._r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)))
49	41, 45, 47, 48	syl3anc 1372	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → (𝐹‘(𝑥(._r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)))
50	9	subrgmcl 20331	. . . . 5 ⊢ ((𝐶 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (𝑥(._r‘𝑅)𝑦) ∈ 𝐶)
51	42, 44, 46, 50	syl3anc 1372	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → (𝑥(._r‘𝑅)𝑦) ∈ 𝐶)
52	51	fvresd 6912	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → ((𝐹 ↾ 𝐶)‘(𝑥(._r‘𝑅)𝑦)) = (𝐹‘(𝑥(._r‘𝑅)𝑦)))
53	44	fvresd 6912	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥))
54	46	fvresd 6912	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → ((𝐹 ↾ 𝐶)‘𝑦) = (𝐹‘𝑦))
55	53, 54	oveq12d 7427	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → (((𝐹 ↾ 𝐶)‘𝑥) · ((𝐹 ↾ 𝐶)‘𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)))
56	49, 52, 55	3eqtr4d 2783	. 2 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → ((𝐹 ↾ 𝐶)‘(𝑥(._r‘𝑅)𝑦)) = (((𝐹 ↾ 𝐶)‘𝑥) · ((𝐹 ↾ 𝐶)‘𝑦)))
57	19, 20, 6	abvtri 20438	. . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝐹‘(𝑥(+_g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
58	41, 45, 47, 57	syl3anc 1372	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → (𝐹‘(𝑥(+_g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
59	6	subrgacl 20330	. . . . 5 ⊢ ((𝐶 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (𝑥(+_g‘𝑅)𝑦) ∈ 𝐶)
60	42, 44, 46, 59	syl3anc 1372	. . . 4 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → (𝑥(+_g‘𝑅)𝑦) ∈ 𝐶)
61	60	fvresd 6912	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → ((𝐹 ↾ 𝐶)‘(𝑥(+_g‘𝑅)𝑦)) = (𝐹‘(𝑥(+_g‘𝑅)𝑦)))
62	53, 54	oveq12d 7427	. . 3 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → (((𝐹 ↾ 𝐶)‘𝑥) + ((𝐹 ↾ 𝐶)‘𝑦)) = ((𝐹‘𝑥) + (𝐹‘𝑦)))
63	58, 61, 62	3brtr4d 5181	. 2 ⊢ (((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) ∧ (𝑥 ∈ 𝐶 ∧ 𝑥 ≠ (0_g‘𝑅)) ∧ (𝑦 ∈ 𝐶 ∧ 𝑦 ≠ (0_g‘𝑅))) → ((𝐹 ↾ 𝐶)‘(𝑥(+_g‘𝑅)𝑦)) ≤ (((𝐹 ↾ 𝐶)‘𝑥) + ((𝐹 ↾ 𝐶)‘𝑦)))
64	2, 5, 8, 11, 16, 18, 24, 30, 40, 56, 63	isabvd 20428	1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝐶 ∈ (SubRing‘𝑅)) → (𝐹 ↾ 𝐶) ∈ 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ⊆ wss 3949 class class class wbr 5149 ↾ cres 5679 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ℝcr 11109 0cc0 11110 + caddc 11113 · cmul 11115 < clt 11248 ≤ cle 11249 Basecbs 17144 ↾_s cress 17173 +_gcplusg 17197 ._rcmulr 17198 0_gc0g 17385 SubGrpcsubg 19000 Ringcrg 20056 SubRingcsubrg 20315 AbsValcabv 20424

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-ico 13330 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-0g 17387 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-grp 18822 df-minusg 18823 df-subg 19003 df-mgp 19988 df-ring 20058 df-subrg 20317 df-abv 20425

This theorem is referenced by: subrgnrg 24190 qabsabv 27132

W3C validator