Theorem clmgrp 25101

Description: A subcomplex module is an additive group. (Contributed by Mario Carneiro, 16-Oct-2015.)

Assertion

Ref	Expression
clmgrp	⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ Grp)

Proof of Theorem clmgrp

Step	Hyp	Ref	Expression
1		clmlmod 25100	. 2 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ LMod)
2		lmodgrp 20865	. 2 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp)
3	1, 2	syl 17	1 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ Grp)

Syntax hints:   → wi 4   ∈ wcel 2108  Grpcgrp 18951  LModclmod 20858  ℂModcclm 25095

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-nul 5306

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-ral 3062  df-rab 3437  df-v 3482  df-sbc 3789  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-iota 6514  df-fv 6569  df-ov 7434  df-lmod 20860  df-clm 25096

This theorem is referenced by:  clmmulg  25134  clmvsrinv  25140  clmvslinv  25141  clmvz  25144  ttgcontlem1  28899