Theorem tngngp3 25002

Description: Alternate definition of a normed group (i.e., a group equipped with a norm) without using the properties of a metric space. This corresponds to the definition in N. H. Bingham, A. J. Ostaszewski: "Normed versus topological groups: dichotomy and duality", 2010, Dissertationes Mathematicae 472, pp. 1-138 and E. Deza, M.M. Deza: "Dictionary of Distances", Elsevier, 2006. (Contributed by AV, 16-Oct-2021.)

Hypotheses

Ref	Expression
tngngp3.t	⊢ 𝑇 = (𝐺 toNrmGrp 𝑁)
tngngp3.x	⊢ 𝑋 = (Base‘𝐺)
tngngp3.z	⊢ 0 = (0g‘𝐺)
tngngp3.p	⊢ + = (+g‘𝐺)
tngngp3.i	⊢ 𝐼 = (invg‘𝐺)

Assertion

Ref	Expression
tngngp3	⊢ (𝑁:𝑋⟶ℝ → (𝑇 ∈ NrmGrp ↔ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))

Distinct variable groups:   𝑥,𝐺,𝑦   𝑥,𝑁,𝑦   𝑥,𝑇,𝑦   𝑥,𝑋,𝑦   𝑥,𝐼,𝑦   𝑥, + ,𝑦   𝑥, 0 ,𝑦

Proof of Theorem tngngp3

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tngngp3.x	. . . . 5 ⊢ 𝑋 = (Base‘𝐺)
2	1	fvexi 6919	. . . 4 ⊢ 𝑋 ∈ V
3		fex 7252	. . . 4 ⊢ ((𝑁:𝑋⟶ℝ ∧ 𝑋 ∈ V) → 𝑁 ∈ V)
4	2, 3	mpan2 704	. . 3 ⊢ (𝑁:𝑋⟶ℝ → 𝑁 ∈ V)
5		tngngp3.t	. . . . . . 7 ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁)
6	5	tnggrpr 25001	. . . . . 6 ⊢ ((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) → 𝐺 ∈ Grp)
7		simp2 1155	. . . . . . . 8 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → 𝐺 ∈ Grp)
8		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (Base‘𝑇) = (Base‘𝑇)
9		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (norm‘𝑇) = (norm‘𝑇)
10		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (0g‘𝑇) = (0g‘𝑇)
11	8, 9, 10	nmeq0 24964	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑇)) → (((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)))
12		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (invg‘𝑇) = (invg‘𝑇)
13	8, 9, 12	nminv 24967	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑇)) → ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥))
14		eqid 2763	. . . . . . . . . . . . . . . 16 ⊢ (+g‘𝑇) = (+g‘𝑇)
15	8, 9, 14	nmtri 24972	. . . . . . . . . . . . . . 15 ⊢ ((𝑇 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑇) ∧ 𝑦 ∈ (Base‘𝑇)) → ((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))
16	15	3expa 1136	. . . . . . . . . . . . . 14 ⊢ (((𝑇 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑇)) ∧ 𝑦 ∈ (Base‘𝑇)) → ((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))
17	16	ralrimiva 3158	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑇)) → ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))
18	11, 13, 17	3jca 1146	. . . . . . . . . . . 12 ⊢ ((𝑇 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑇)) → ((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦))))
19	18	ralrimiva 3158	. . . . . . . . . . 11 ⊢ (𝑇 ∈ NrmGrp → ∀𝑥 ∈ (Base‘𝑇)((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦))))
20	19	adantl 487	. . . . . . . . . 10 ⊢ ((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) → ∀𝑥 ∈ (Base‘𝑇)((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦))))
21	20	3ad2ant1 1151	. . . . . . . . 9 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → ∀𝑥 ∈ (Base‘𝑇)((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦))))
22	5, 1	tngbas 24987	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ V → 𝑋 = (Base‘𝑇))
23		tngngp3.p	. . . . . . . . . . . . . . 15 ⊢ + = (+g‘𝐺)
24	5, 23	tngplusg 24988	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ V → + = (+g‘𝑇))
25		tngngp3.i	. . . . . . . . . . . . . . 15 ⊢ 𝐼 = (invg‘𝐺)
26		eqidd 2764	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ V → (Base‘𝐺) = (Base‘𝐺))
27		eqid 2763	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘𝐺) = (Base‘𝐺)
28	5, 27	tngbas 24987	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ V → (Base‘𝐺) = (Base‘𝑇))
29		eqid 2763	. . . . . . . . . . . . . . . . . . 19 ⊢ (+g‘𝐺) = (+g‘𝐺)
30	5, 29	tngplusg 24988	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ V → (+g‘𝐺) = (+g‘𝑇))
31	30	oveqd 7457	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ V → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝑇)𝑦))
32	31	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ V ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝑇)𝑦))
33	26, 28, 32	grpinvpropd 19251	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ V → (invg‘𝐺) = (invg‘𝑇))
34	25, 33	eqtrid 2810	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ V → 𝐼 = (invg‘𝑇))
35	22, 24, 34	3jca 1146	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ V → (𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)))
36	35	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) → (𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)))
37	36	3ad2ant1 1151	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → (𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)))
38		reex 11315	. . . . . . . . . . . . 13 ⊢ ℝ ∈ V
39	5, 1, 38	tngnm 24997	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → 𝑁 = (norm‘𝑇))
40	39	3adant1 1148	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → 𝑁 = (norm‘𝑇))
41		tngngp3.z	. . . . . . . . . . . . . 14 ⊢ 0 = (0g‘𝐺)
42	5, 41	tng0 24989	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ V → 0 = (0g‘𝑇))
43	42	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) → 0 = (0g‘𝑇))
44	43	3ad2ant1 1151	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → 0 = (0g‘𝑇))
45	37, 40, 44	3jca 1146	. . . . . . . . . 10 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → ((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)))
46		simp1 1154	. . . . . . . . . . . 12 ⊢ ((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) → 𝑋 = (Base‘𝑇))
47	46	3ad2ant1 1151	. . . . . . . . . . 11 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → 𝑋 = (Base‘𝑇))
48		simp2 1155	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → 𝑁 = (norm‘𝑇))
49	48	fveq1d 6907	. . . . . . . . . . . . . 14 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (𝑁‘𝑥) = ((norm‘𝑇)‘𝑥))
50	49	eqeq1d 2765	. . . . . . . . . . . . 13 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → ((𝑁‘𝑥) = 0 ↔ ((norm‘𝑇)‘𝑥) = 0))
51		simp3 1156	. . . . . . . . . . . . . 14 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → 0 = (0g‘𝑇))
52	51	eqeq2d 2774	. . . . . . . . . . . . 13 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (𝑥 = 0 ↔ 𝑥 = (0g‘𝑇)))
53	50, 52	bibi12d 348	. . . . . . . . . . . 12 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ↔ (((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇))))
54		simp3 1156	. . . . . . . . . . . . . . . 16 ⊢ ((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) → 𝐼 = (invg‘𝑇))
55	54	3ad2ant1 1151	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → 𝐼 = (invg‘𝑇))
56	55	fveq1d 6907	. . . . . . . . . . . . . 14 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (𝐼‘𝑥) = ((invg‘𝑇)‘𝑥))
57	48, 56	fveq12d 6912	. . . . . . . . . . . . 13 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (𝑁‘(𝐼‘𝑥)) = ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)))
58	57, 49	eqeq12d 2779	. . . . . . . . . . . 12 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ↔ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥)))
59		simp2 1155	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) → + = (+g‘𝑇))
60	59	3ad2ant1 1151	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → + = (+g‘𝑇))
61	60	oveqd 7457	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (𝑥 + 𝑦) = (𝑥(+g‘𝑇)𝑦))
62	48, 61	fveq12d 6912	. . . . . . . . . . . . . 14 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (𝑁‘(𝑥 + 𝑦)) = ((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)))
63		fveq1 6904	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 = (norm‘𝑇) → (𝑁‘𝑥) = ((norm‘𝑇)‘𝑥))
64		fveq1 6904	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 = (norm‘𝑇) → (𝑁‘𝑦) = ((norm‘𝑇)‘𝑦))
65	63, 64	oveq12d 7458	. . . . . . . . . . . . . . 15 ⊢ (𝑁 = (norm‘𝑇) → ((𝑁‘𝑥) + (𝑁‘𝑦)) = (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))
66	65	3ad2ant2 1152	. . . . . . . . . . . . . 14 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → ((𝑁‘𝑥) + (𝑁‘𝑦)) = (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))
67	62, 66	breq12d 5119	. . . . . . . . . . . . 13 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → ((𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) ↔ ((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦))))
68	47, 67	raleqbidv 3338	. . . . . . . . . . . 12 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦))))
69	53, 58, 68	3anbi123d 1465	. . . . . . . . . . 11 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → ((((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ ((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))))
70	47, 69	raleqbidv 3338	. . . . . . . . . 10 ⊢ (((𝑋 = (Base‘𝑇) ∧ + = (+g‘𝑇) ∧ 𝐼 = (invg‘𝑇)) ∧ 𝑁 = (norm‘𝑇) ∧ 0 = (0g‘𝑇)) → (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ ∀𝑥 ∈ (Base‘𝑇)((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))))
71	45, 70	syl 18	. . . . . . . . 9 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ ∀𝑥 ∈ (Base‘𝑇)((((norm‘𝑇)‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑇)) ∧ ((norm‘𝑇)‘((invg‘𝑇)‘𝑥)) = ((norm‘𝑇)‘𝑥) ∧ ∀𝑦 ∈ (Base‘𝑇)((norm‘𝑇)‘(𝑥(+g‘𝑇)𝑦)) ≤ (((norm‘𝑇)‘𝑥) + ((norm‘𝑇)‘𝑦)))))
72	21, 71	mpbird 260	. . . . . . . 8 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))
73	7, 72	jca 521	. . . . . . 7 ⊢ (((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) ∧ 𝐺 ∈ Grp ∧ 𝑁:𝑋⟶ℝ) → (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
74	73	3exp 1137	. . . . . 6 ⊢ ((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) → (𝐺 ∈ Grp → (𝑁:𝑋⟶ℝ → (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))))
75	6, 74	mpd 16	. . . . 5 ⊢ ((𝑁 ∈ V ∧ 𝑇 ∈ NrmGrp) → (𝑁:𝑋⟶ℝ → (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))
76	75	expcom 419	. . . 4 ⊢ (𝑇 ∈ NrmGrp → (𝑁 ∈ V → (𝑁:𝑋⟶ℝ → (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))))
77	76	com13 89	. . 3 ⊢ (𝑁:𝑋⟶ℝ → (𝑁 ∈ V → (𝑇 ∈ NrmGrp → (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))))
78	4, 77	mpd 16	. 2 ⊢ (𝑁:𝑋⟶ℝ → (𝑇 ∈ NrmGrp → (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))
79		eqid 2763	. . . 4 ⊢ (-g‘𝐺) = (-g‘𝐺)
80		simpl 488	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) → 𝐺 ∈ Grp)
81	80	adantl 487	. . . 4 ⊢ ((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) → 𝐺 ∈ Grp)
82		simpl 488	. . . 4 ⊢ ((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) → 𝑁:𝑋⟶ℝ)
83		fveq2 6905	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → (𝑁‘𝑥) = (𝑁‘𝑎))
84	83	eqeq1d 2765	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → ((𝑁‘𝑥) = 0 ↔ (𝑁‘𝑎) = 0))
85		eqeq1 2767	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (𝑥 = 0 ↔ 𝑎 = 0 ))
86	84, 85	bibi12d 348	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ↔ ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 )))
87		fveq2 6905	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → (𝐼‘𝑥) = (𝐼‘𝑎))
88	87	fveq2d 6909	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (𝑁‘(𝐼‘𝑥)) = (𝑁‘(𝐼‘𝑎)))
89	88, 83	eqeq12d 2779	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ↔ (𝑁‘(𝐼‘𝑎)) = (𝑁‘𝑎)))
90		fvoveq1 7463	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → (𝑁‘(𝑥 + 𝑦)) = (𝑁‘(𝑎 + 𝑦)))
91	83	oveq1d 7455	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → ((𝑁‘𝑥) + (𝑁‘𝑦)) = ((𝑁‘𝑎) + (𝑁‘𝑦)))
92	90, 91	breq12d 5119	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → ((𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) ↔ (𝑁‘(𝑎 + 𝑦)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑦))))
93	92	ralbidv 3189	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → (∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) ↔ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑎 + 𝑦)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑦))))
94	86, 89, 93	3anbi123d 1465	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → ((((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ (((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 ) ∧ (𝑁‘(𝐼‘𝑎)) = (𝑁‘𝑎) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑎 + 𝑦)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑦)))))
95	94	rspccva 3579	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝑎 ∈ 𝑋) → (((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 ) ∧ (𝑁‘(𝐼‘𝑎)) = (𝑁‘𝑎) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑎 + 𝑦)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑦))))
96		simp1 1154	. . . . . . . . 9 ⊢ ((((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 ) ∧ (𝑁‘(𝐼‘𝑎)) = (𝑁‘𝑎) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑎 + 𝑦)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑦))) → ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 ))
97	95, 96	syl 18	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝑎 ∈ 𝑋) → ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 ))
98	97	ex 418	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → (𝑎 ∈ 𝑋 → ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 )))
99	98	adantl 487	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) → (𝑎 ∈ 𝑋 → ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 )))
100	99	adantl 487	. . . . 5 ⊢ ((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) → (𝑎 ∈ 𝑋 → ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 )))
101	100	imp 412	. . . 4 ⊢ (((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) ∧ 𝑎 ∈ 𝑋) → ((𝑁‘𝑎) = 0 ↔ 𝑎 = 0 ))
102	1, 23, 25, 79	grpsubval 19222	. . . . . . 7 ⊢ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑎(-g‘𝐺)𝑏) = (𝑎 + (𝐼‘𝑏)))
103	102	adantl 487	. . . . . 6 ⊢ (((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎(-g‘𝐺)𝑏) = (𝑎 + (𝐼‘𝑏)))
104	103	fveq2d 6909	. . . . 5 ⊢ (((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘(𝑎(-g‘𝐺)𝑏)) = (𝑁‘(𝑎 + (𝐼‘𝑏))))
105		3simpc 1168	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))
106	105	ralimi 3103	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))
107		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))
108	107	ralimi 3103	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))
109		oveq2 7448	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = (𝐼‘𝑏) → (𝑎 + 𝑦) = (𝑎 + (𝐼‘𝑏)))
110	109	fveq2d 6909	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = (𝐼‘𝑏) → (𝑁‘(𝑎 + 𝑦)) = (𝑁‘(𝑎 + (𝐼‘𝑏))))
111		fveq2 6905	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = (𝐼‘𝑏) → (𝑁‘𝑦) = (𝑁‘(𝐼‘𝑏)))
112	111	oveq2d 7456	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = (𝐼‘𝑏) → ((𝑁‘𝑎) + (𝑁‘𝑦)) = ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏))))
113	110, 112	breq12d 5119	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝐼‘𝑏) → ((𝑁‘(𝑎 + 𝑦)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑦)) ↔ (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏)))))
114	92, 113	rspc2v 3590	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 ∈ 𝑋 ∧ (𝐼‘𝑏) ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏)))))
115	1, 25	grpinvcl 19224	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ 𝑋) → (𝐼‘𝑏) ∈ 𝑋)
116	115	ex 418	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐺 ∈ Grp → (𝑏 ∈ 𝑋 → (𝐼‘𝑏) ∈ 𝑋))
117	116	anim2d 624	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐺 ∈ Grp → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑎 ∈ 𝑋 ∧ (𝐼‘𝑏) ∈ 𝑋)))
118	117	imp 412	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎 ∈ 𝑋 ∧ (𝐼‘𝑏) ∈ 𝑋))
119	114, 118	syl11 34	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) → ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏)))))
120	119	expd 421	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)) → (𝐺 ∈ Grp → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏))))))
121	108, 120	syl 18	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → (𝐺 ∈ Grp → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏))))))
122	121	imp 412	. . . . . . . . . . . . 13 ⊢ ((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏)))))
123	122	imp 412	. . . . . . . . . . . 12 ⊢ (((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏))))
124		simpl 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥))
125	124	ralimi 3103	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ∀𝑥 ∈ 𝑋 (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥))
126		fveq2 6905	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 = 𝑏 → (𝐼‘𝑥) = (𝐼‘𝑏))
127	126	fveq2d 6909	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑏 → (𝑁‘(𝐼‘𝑥)) = (𝑁‘(𝐼‘𝑏)))
128		fveq2 6905	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑏 → (𝑁‘𝑥) = (𝑁‘𝑏))
129	127, 128	eqeq12d 2779	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑏 → ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ↔ (𝑁‘(𝐼‘𝑏)) = (𝑁‘𝑏)))
130	129	rspccva 3579	. . . . . . . . . . . . . . . . . . 19 ⊢ ((∀𝑥 ∈ 𝑋 (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝐼‘𝑏)) = (𝑁‘𝑏))
131	130	eqcomd 2769	. . . . . . . . . . . . . . . . . 18 ⊢ ((∀𝑥 ∈ 𝑋 (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ 𝑏 ∈ 𝑋) → (𝑁‘𝑏) = (𝑁‘(𝐼‘𝑏)))
132	131	ex 418	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑥 ∈ 𝑋 (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) → (𝑏 ∈ 𝑋 → (𝑁‘𝑏) = (𝑁‘(𝐼‘𝑏))))
133	125, 132	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → (𝑏 ∈ 𝑋 → (𝑁‘𝑏) = (𝑁‘(𝐼‘𝑏))))
134	133	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) → (𝑏 ∈ 𝑋 → (𝑁‘𝑏) = (𝑁‘(𝐼‘𝑏))))
135	134	adantld 496	. . . . . . . . . . . . . 14 ⊢ ((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘𝑏) = (𝑁‘(𝐼‘𝑏))))
136	135	imp 412	. . . . . . . . . . . . 13 ⊢ (((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘𝑏) = (𝑁‘(𝐼‘𝑏)))
137	136	oveq2d 7456	. . . . . . . . . . . 12 ⊢ (((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → ((𝑁‘𝑎) + (𝑁‘𝑏)) = ((𝑁‘𝑎) + (𝑁‘(𝐼‘𝑏))))
138	123, 137	breqtrrd 5136	. . . . . . . . . . 11 ⊢ (((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏)))
139	138	ex 418	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ∧ 𝐺 ∈ Grp) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏))))
140	139	ex 418	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝑋 ((𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → (𝐺 ∈ Grp → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏)))))
141	106, 140	syl 18	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → (𝐺 ∈ Grp → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏)))))
142	141	impcom 413	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏))))
143	142	adantl 487	. . . . . 6 ⊢ ((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) → ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏))))
144	143	imp 412	. . . . 5 ⊢ (((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘(𝑎 + (𝐼‘𝑏))) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏)))
145	104, 144	eqbrtrd 5130	. . . 4 ⊢ (((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) ∧ (𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑁‘(𝑎(-g‘𝐺)𝑏)) ≤ ((𝑁‘𝑎) + (𝑁‘𝑏)))
146	5, 1, 79, 41, 81, 82, 101, 145	tngngpd 24999	. . 3 ⊢ ((𝑁:𝑋⟶ℝ ∧ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) → 𝑇 ∈ NrmGrp)
147	146	ex 418	. 2 ⊢ (𝑁:𝑋⟶ℝ → ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) → 𝑇 ∈ NrmGrp))
148	78, 147	impbid 215	1 ⊢ (𝑁:𝑋⟶ℝ → (𝑇 ∈ NrmGrp ↔ (𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ (𝑁‘(𝐼‘𝑥)) = (𝑁‘𝑥) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥 + 𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   class class class wbr 5106  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440  ℝcr 11223  0cc0 11224   + caddc 11227   ≤ cle 11368  Basecbs 17413  +_gcplusg 17454  0_gc0g 17636  Grpcgrp 19170  inv_gcminusg 19171  -_gcsg 19172  normcnm 24922  NrmGrpcngp 24923   toNrmGrp ctng 24924

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301  ax-pre-sup 11302

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-er 8742  df-map 8874  df-en 8999  df-dom 9000  df-sdom 9001  df-sup 9458  df-inf 9459  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-div 11998  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-5 12432  df-6 12433  df-7 12434  df-8 12435  df-9 12436  df-n0 12631  df-z 12718  df-dec 12839  df-uz 12990  df-q 13100  df-rp 13145  df-xneg 13265  df-xadd 13266  df-xmul 13267  df-sets 17368  df-slot 17386  df-ndx 17398  df-base 17414  df-plusg 17467  df-tset 17473  df-ds 17476  df-rest 17619  df-topn 17620  df-0g 17638  df-topgen 17640  df-mgm 18842  df-sgrp 18934  df-mnd 18950  df-grp 19173  df-minusg 19174  df-sbg 19175  df-psmet 21697  df-xmet 21698  df-met 21699  df-bl 21700  df-mopn 21701  df-top 23239  df-topon 23256  df-topsp 23278  df-bases 23291  df-xms 24666  df-ms 24667  df-nm 24928  df-ngp 24929  df-tng 24930

This theorem is used by: (None)