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

Theorem nmoco 22351
Description: An upper bound on the operator norm of a composition. (Contributed by Mario Carneiro, 20-Oct-2015.)
Hypotheses
Ref Expression
nmoco.1 𝑁 = (𝑆 normOp 𝑈)
nmoco.2 𝐿 = (𝑇 normOp 𝑈)
nmoco.3 𝑀 = (𝑆 normOp 𝑇)
Assertion
Ref Expression
nmoco ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝑁‘(𝐹𝐺)) ≤ ((𝐿𝐹) · (𝑀𝐺)))

Proof of Theorem nmoco
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 nmoco.1 . 2 𝑁 = (𝑆 normOp 𝑈)
2 eqid 2610 . 2 (Base‘𝑆) = (Base‘𝑆)
3 eqid 2610 . 2 (norm‘𝑆) = (norm‘𝑆)
4 eqid 2610 . 2 (norm‘𝑈) = (norm‘𝑈)
5 eqid 2610 . 2 (0g𝑆) = (0g𝑆)
6 nghmrcl1 22346 . . 3 (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝑆 ∈ NrmGrp)
76adantl 481 . 2 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑆 ∈ NrmGrp)
8 nghmrcl2 22347 . . 3 (𝐹 ∈ (𝑇 NGHom 𝑈) → 𝑈 ∈ NrmGrp)
98adantr 480 . 2 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 𝑈 ∈ NrmGrp)
10 nghmghm 22348 . . 3 (𝐹 ∈ (𝑇 NGHom 𝑈) → 𝐹 ∈ (𝑇 GrpHom 𝑈))
11 nghmghm 22348 . . 3 (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝐺 ∈ (𝑆 GrpHom 𝑇))
12 ghmco 17503 . . 3 ((𝐹 ∈ (𝑇 GrpHom 𝑈) ∧ 𝐺 ∈ (𝑆 GrpHom 𝑇)) → (𝐹𝐺) ∈ (𝑆 GrpHom 𝑈))
1310, 11, 12syl2an 493 . 2 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝐹𝐺) ∈ (𝑆 GrpHom 𝑈))
14 nmoco.2 . . . 4 𝐿 = (𝑇 normOp 𝑈)
1514nghmcl 22341 . . 3 (𝐹 ∈ (𝑇 NGHom 𝑈) → (𝐿𝐹) ∈ ℝ)
16 nmoco.3 . . . 4 𝑀 = (𝑆 normOp 𝑇)
1716nghmcl 22341 . . 3 (𝐺 ∈ (𝑆 NGHom 𝑇) → (𝑀𝐺) ∈ ℝ)
18 remulcl 9900 . . 3 (((𝐿𝐹) ∈ ℝ ∧ (𝑀𝐺) ∈ ℝ) → ((𝐿𝐹) · (𝑀𝐺)) ∈ ℝ)
1915, 17, 18syl2an 493 . 2 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → ((𝐿𝐹) · (𝑀𝐺)) ∈ ℝ)
20 nghmrcl1 22346 . . . . 5 (𝐹 ∈ (𝑇 NGHom 𝑈) → 𝑇 ∈ NrmGrp)
2114nmoge0 22335 . . . . 5 ((𝑇 ∈ NrmGrp ∧ 𝑈 ∈ NrmGrp ∧ 𝐹 ∈ (𝑇 GrpHom 𝑈)) → 0 ≤ (𝐿𝐹))
2220, 8, 10, 21syl3anc 1318 . . . 4 (𝐹 ∈ (𝑇 NGHom 𝑈) → 0 ≤ (𝐿𝐹))
2315, 22jca 553 . . 3 (𝐹 ∈ (𝑇 NGHom 𝑈) → ((𝐿𝐹) ∈ ℝ ∧ 0 ≤ (𝐿𝐹)))
24 nghmrcl2 22347 . . . . 5 (𝐺 ∈ (𝑆 NGHom 𝑇) → 𝑇 ∈ NrmGrp)
2516nmoge0 22335 . . . . 5 ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐺 ∈ (𝑆 GrpHom 𝑇)) → 0 ≤ (𝑀𝐺))
266, 24, 11, 25syl3anc 1318 . . . 4 (𝐺 ∈ (𝑆 NGHom 𝑇) → 0 ≤ (𝑀𝐺))
2717, 26jca 553 . . 3 (𝐺 ∈ (𝑆 NGHom 𝑇) → ((𝑀𝐺) ∈ ℝ ∧ 0 ≤ (𝑀𝐺)))
28 mulge0 10425 . . 3 ((((𝐿𝐹) ∈ ℝ ∧ 0 ≤ (𝐿𝐹)) ∧ ((𝑀𝐺) ∈ ℝ ∧ 0 ≤ (𝑀𝐺))) → 0 ≤ ((𝐿𝐹) · (𝑀𝐺)))
2923, 27, 28syl2an 493 . 2 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → 0 ≤ ((𝐿𝐹) · (𝑀𝐺)))
308ad2antrr 758 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝑈 ∈ NrmGrp)
3110ad2antrr 758 . . . . . . 7 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝐹 ∈ (𝑇 GrpHom 𝑈))
32 eqid 2610 . . . . . . . 8 (Base‘𝑇) = (Base‘𝑇)
33 eqid 2610 . . . . . . . 8 (Base‘𝑈) = (Base‘𝑈)
3432, 33ghmf 17487 . . . . . . 7 (𝐹 ∈ (𝑇 GrpHom 𝑈) → 𝐹:(Base‘𝑇)⟶(Base‘𝑈))
3531, 34syl 17 . . . . . 6 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝐹:(Base‘𝑇)⟶(Base‘𝑈))
3611ad2antlr 759 . . . . . . . 8 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝐺 ∈ (𝑆 GrpHom 𝑇))
372, 32ghmf 17487 . . . . . . . 8 (𝐺 ∈ (𝑆 GrpHom 𝑇) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
3836, 37syl 17 . . . . . . 7 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝐺:(Base‘𝑆)⟶(Base‘𝑇))
39 simprl 790 . . . . . . 7 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝑥 ∈ (Base‘𝑆))
4038, 39ffvelrnd 6268 . . . . . 6 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (𝐺𝑥) ∈ (Base‘𝑇))
4135, 40ffvelrnd 6268 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (𝐹‘(𝐺𝑥)) ∈ (Base‘𝑈))
4233, 4nmcl 22230 . . . . 5 ((𝑈 ∈ NrmGrp ∧ (𝐹‘(𝐺𝑥)) ∈ (Base‘𝑈)) → ((norm‘𝑈)‘(𝐹‘(𝐺𝑥))) ∈ ℝ)
4330, 41, 42syl2anc 691 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑈)‘(𝐹‘(𝐺𝑥))) ∈ ℝ)
4415ad2antrr 758 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (𝐿𝐹) ∈ ℝ)
4520ad2antrr 758 . . . . . 6 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝑇 ∈ NrmGrp)
46 eqid 2610 . . . . . . 7 (norm‘𝑇) = (norm‘𝑇)
4732, 46nmcl 22230 . . . . . 6 ((𝑇 ∈ NrmGrp ∧ (𝐺𝑥) ∈ (Base‘𝑇)) → ((norm‘𝑇)‘(𝐺𝑥)) ∈ ℝ)
4845, 40, 47syl2anc 691 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑇)‘(𝐺𝑥)) ∈ ℝ)
4944, 48remulcld 9949 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((𝐿𝐹) · ((norm‘𝑇)‘(𝐺𝑥))) ∈ ℝ)
5017ad2antlr 759 . . . . . 6 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (𝑀𝐺) ∈ ℝ)
512, 3nmcl 22230 . . . . . . . 8 ((𝑆 ∈ NrmGrp ∧ 𝑥 ∈ (Base‘𝑆)) → ((norm‘𝑆)‘𝑥) ∈ ℝ)
526, 51sylan 487 . . . . . . 7 ((𝐺 ∈ (𝑆 NGHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆)) → ((norm‘𝑆)‘𝑥) ∈ ℝ)
5352ad2ant2lr 780 . . . . . 6 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑆)‘𝑥) ∈ ℝ)
5450, 53remulcld 9949 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((𝑀𝐺) · ((norm‘𝑆)‘𝑥)) ∈ ℝ)
5544, 54remulcld 9949 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((𝐿𝐹) · ((𝑀𝐺) · ((norm‘𝑆)‘𝑥))) ∈ ℝ)
56 simpll 786 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → 𝐹 ∈ (𝑇 NGHom 𝑈))
5714, 32, 46, 4nmoi 22342 . . . . 5 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ (𝐺𝑥) ∈ (Base‘𝑇)) → ((norm‘𝑈)‘(𝐹‘(𝐺𝑥))) ≤ ((𝐿𝐹) · ((norm‘𝑇)‘(𝐺𝑥))))
5856, 40, 57syl2anc 691 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑈)‘(𝐹‘(𝐺𝑥))) ≤ ((𝐿𝐹) · ((norm‘𝑇)‘(𝐺𝑥))))
5923ad2antrr 758 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((𝐿𝐹) ∈ ℝ ∧ 0 ≤ (𝐿𝐹)))
6016, 2, 3, 46nmoi 22342 . . . . . 6 ((𝐺 ∈ (𝑆 NGHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆)) → ((norm‘𝑇)‘(𝐺𝑥)) ≤ ((𝑀𝐺) · ((norm‘𝑆)‘𝑥)))
6160ad2ant2lr 780 . . . . 5 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑇)‘(𝐺𝑥)) ≤ ((𝑀𝐺) · ((norm‘𝑆)‘𝑥)))
62 lemul2a 10757 . . . . 5 (((((norm‘𝑇)‘(𝐺𝑥)) ∈ ℝ ∧ ((𝑀𝐺) · ((norm‘𝑆)‘𝑥)) ∈ ℝ ∧ ((𝐿𝐹) ∈ ℝ ∧ 0 ≤ (𝐿𝐹))) ∧ ((norm‘𝑇)‘(𝐺𝑥)) ≤ ((𝑀𝐺) · ((norm‘𝑆)‘𝑥))) → ((𝐿𝐹) · ((norm‘𝑇)‘(𝐺𝑥))) ≤ ((𝐿𝐹) · ((𝑀𝐺) · ((norm‘𝑆)‘𝑥))))
6348, 54, 59, 61, 62syl31anc 1321 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((𝐿𝐹) · ((norm‘𝑇)‘(𝐺𝑥))) ≤ ((𝐿𝐹) · ((𝑀𝐺) · ((norm‘𝑆)‘𝑥))))
6443, 49, 55, 58, 63letrd 10073 . . 3 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑈)‘(𝐹‘(𝐺𝑥))) ≤ ((𝐿𝐹) · ((𝑀𝐺) · ((norm‘𝑆)‘𝑥))))
65 fvco3 6185 . . . . 5 ((𝐺:(Base‘𝑆)⟶(Base‘𝑇) ∧ 𝑥 ∈ (Base‘𝑆)) → ((𝐹𝐺)‘𝑥) = (𝐹‘(𝐺𝑥)))
6638, 39, 65syl2anc 691 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((𝐹𝐺)‘𝑥) = (𝐹‘(𝐺𝑥)))
6766fveq2d 6107 . . 3 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑈)‘((𝐹𝐺)‘𝑥)) = ((norm‘𝑈)‘(𝐹‘(𝐺𝑥))))
6844recnd 9947 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (𝐿𝐹) ∈ ℂ)
6950recnd 9947 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (𝑀𝐺) ∈ ℂ)
7053recnd 9947 . . . 4 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑆)‘𝑥) ∈ ℂ)
7168, 69, 70mulassd 9942 . . 3 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → (((𝐿𝐹) · (𝑀𝐺)) · ((norm‘𝑆)‘𝑥)) = ((𝐿𝐹) · ((𝑀𝐺) · ((norm‘𝑆)‘𝑥))))
7264, 67, 713brtr4d 4615 . 2 (((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑥 ≠ (0g𝑆))) → ((norm‘𝑈)‘((𝐹𝐺)‘𝑥)) ≤ (((𝐿𝐹) · (𝑀𝐺)) · ((norm‘𝑆)‘𝑥)))
731, 2, 3, 4, 5, 7, 9, 13, 19, 29, 72nmolb2d 22332 1 ((𝐹 ∈ (𝑇 NGHom 𝑈) ∧ 𝐺 ∈ (𝑆 NGHom 𝑇)) → (𝑁‘(𝐹𝐺)) ≤ ((𝐿𝐹) · (𝑀𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  wne 2780   class class class wbr 4583  ccom 5042  wf 5800  cfv 5804  (class class class)co 6549  cr 9814  0cc0 9815   · cmul 9820  cle 9954  Basecbs 15695  0gc0g 15923   GrpHom cghm 17480  normcnm 22191  NrmGrpcngp 22192   normOp cnmo 22319   NGHom cnghm 22320
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-sup 8231  df-inf 8232  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-q 11665  df-rp 11709  df-xneg 11822  df-xadd 11823  df-xmul 11824  df-ico 12052  df-0g 15925  df-topgen 15927  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-mhm 17158  df-grp 17248  df-ghm 17481  df-psmet 19559  df-xmet 19560  df-met 19561  df-bl 19562  df-mopn 19563  df-top 20521  df-bases 20522  df-topon 20523  df-topsp 20524  df-xms 21935  df-ms 21936  df-nm 22197  df-ngp 22198  df-nmo 22322  df-nghm 22323
This theorem is referenced by:  nghmco  22352
  Copyright terms: Public domain W3C validator