Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lmhmfgsplit Structured version   Visualization version   GIF version

Theorem lmhmfgsplit 41399
Description: If the kernel and range of a homomorphism of left modules are finitely generated, then so is the domain. (Contributed by Stefan O'Rear, 1-Jan-2015.) (Revised by Stefan O'Rear, 6-May-2015.)
Hypotheses
Ref Expression
lmhmfgsplit.z 0 = (0g𝑇)
lmhmfgsplit.k 𝐾 = (𝐹 “ { 0 })
lmhmfgsplit.u 𝑈 = (𝑆s 𝐾)
lmhmfgsplit.v 𝑉 = (𝑇s ran 𝐹)
Assertion
Ref Expression
lmhmfgsplit ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → 𝑆 ∈ LFinGen)

Proof of Theorem lmhmfgsplit
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp3 1138 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → 𝑉 ∈ LFinGen)
2 lmhmlmod2 20493 . . . . 5 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
323ad2ant1 1133 . . . 4 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → 𝑇 ∈ LMod)
4 lmhmrnlss 20511 . . . . 5 (𝐹 ∈ (𝑆 LMHom 𝑇) → ran 𝐹 ∈ (LSubSp‘𝑇))
543ad2ant1 1133 . . . 4 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → ran 𝐹 ∈ (LSubSp‘𝑇))
6 lmhmfgsplit.v . . . . 5 𝑉 = (𝑇s ran 𝐹)
7 eqid 2736 . . . . 5 (LSubSp‘𝑇) = (LSubSp‘𝑇)
8 eqid 2736 . . . . 5 (LSpan‘𝑇) = (LSpan‘𝑇)
96, 7, 8islssfg 41383 . . . 4 ((𝑇 ∈ LMod ∧ ran 𝐹 ∈ (LSubSp‘𝑇)) → (𝑉 ∈ LFinGen ↔ ∃𝑎 ∈ 𝒫 ran 𝐹(𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹)))
103, 5, 9syl2anc 584 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → (𝑉 ∈ LFinGen ↔ ∃𝑎 ∈ 𝒫 ran 𝐹(𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹)))
111, 10mpbid 231 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → ∃𝑎 ∈ 𝒫 ran 𝐹(𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))
12 simpl1 1191 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) → 𝐹 ∈ (𝑆 LMHom 𝑇))
13 eqid 2736 . . . . . 6 (Base‘𝑆) = (Base‘𝑆)
14 eqid 2736 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
1513, 14lmhmf 20495 . . . . 5 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
16 ffn 6668 . . . . 5 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → 𝐹 Fn (Base‘𝑆))
1712, 15, 163syl 18 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) → 𝐹 Fn (Base‘𝑆))
18 elpwi 4567 . . . . 5 (𝑎 ∈ 𝒫 ran 𝐹𝑎 ⊆ ran 𝐹)
1918ad2antrl 726 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) → 𝑎 ⊆ ran 𝐹)
20 simprrl 779 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) → 𝑎 ∈ Fin)
21 fipreima 9302 . . . 4 ((𝐹 Fn (Base‘𝑆) ∧ 𝑎 ⊆ ran 𝐹𝑎 ∈ Fin) → ∃𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin)(𝐹𝑏) = 𝑎)
2217, 19, 20, 21syl3anc 1371 . . 3 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) → ∃𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin)(𝐹𝑏) = 𝑎)
23 eqid 2736 . . . . . . 7 (LSubSp‘𝑆) = (LSubSp‘𝑆)
24 eqid 2736 . . . . . . 7 (LSSum‘𝑆) = (LSSum‘𝑆)
25 lmhmfgsplit.z . . . . . . 7 0 = (0g𝑇)
26 lmhmfgsplit.k . . . . . . 7 𝐾 = (𝐹 “ { 0 })
27 simpll1 1212 . . . . . . 7 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝐹 ∈ (𝑆 LMHom 𝑇))
28 lmhmlmod1 20494 . . . . . . . . . 10 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
29283ad2ant1 1133 . . . . . . . . 9 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → 𝑆 ∈ LMod)
3029ad2antrr 724 . . . . . . . 8 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝑆 ∈ LMod)
31 inss1 4188 . . . . . . . . . . 11 (𝒫 (Base‘𝑆) ∩ Fin) ⊆ 𝒫 (Base‘𝑆)
3231sseli 3940 . . . . . . . . . 10 (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑏 ∈ 𝒫 (Base‘𝑆))
33 elpwi 4567 . . . . . . . . . 10 (𝑏 ∈ 𝒫 (Base‘𝑆) → 𝑏 ⊆ (Base‘𝑆))
3432, 33syl 17 . . . . . . . . 9 (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑏 ⊆ (Base‘𝑆))
3534ad2antrl 726 . . . . . . . 8 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝑏 ⊆ (Base‘𝑆))
36 eqid 2736 . . . . . . . . 9 (LSpan‘𝑆) = (LSpan‘𝑆)
3713, 23, 36lspcl 20437 . . . . . . . 8 ((𝑆 ∈ LMod ∧ 𝑏 ⊆ (Base‘𝑆)) → ((LSpan‘𝑆)‘𝑏) ∈ (LSubSp‘𝑆))
3830, 35, 37syl2anc 584 . . . . . . 7 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → ((LSpan‘𝑆)‘𝑏) ∈ (LSubSp‘𝑆))
3913, 36, 8lmhmlsp 20510 . . . . . . . . 9 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑏 ⊆ (Base‘𝑆)) → (𝐹 “ ((LSpan‘𝑆)‘𝑏)) = ((LSpan‘𝑇)‘(𝐹𝑏)))
4027, 35, 39syl2anc 584 . . . . . . . 8 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝐹 “ ((LSpan‘𝑆)‘𝑏)) = ((LSpan‘𝑇)‘(𝐹𝑏)))
41 fveq2 6842 . . . . . . . . 9 ((𝐹𝑏) = 𝑎 → ((LSpan‘𝑇)‘(𝐹𝑏)) = ((LSpan‘𝑇)‘𝑎))
4241ad2antll 727 . . . . . . . 8 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → ((LSpan‘𝑇)‘(𝐹𝑏)) = ((LSpan‘𝑇)‘𝑎))
43 simp2rr 1243 . . . . . . . . 9 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹)) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → ((LSpan‘𝑇)‘𝑎) = ran 𝐹)
44433expa 1118 . . . . . . . 8 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → ((LSpan‘𝑇)‘𝑎) = ran 𝐹)
4540, 42, 443eqtrd 2780 . . . . . . 7 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝐹 “ ((LSpan‘𝑆)‘𝑏)) = ran 𝐹)
4623, 24, 25, 26, 13, 27, 38, 45kercvrlsm 41396 . . . . . 6 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝐾(LSSum‘𝑆)((LSpan‘𝑆)‘𝑏)) = (Base‘𝑆))
4746oveq2d 7373 . . . . 5 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝑆s (𝐾(LSSum‘𝑆)((LSpan‘𝑆)‘𝑏))) = (𝑆s (Base‘𝑆)))
4813ressid 17125 . . . . . . 7 (𝑆 ∈ LMod → (𝑆s (Base‘𝑆)) = 𝑆)
4929, 48syl 17 . . . . . 6 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → (𝑆s (Base‘𝑆)) = 𝑆)
5049ad2antrr 724 . . . . 5 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝑆s (Base‘𝑆)) = 𝑆)
5147, 50eqtr2d 2777 . . . 4 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝑆 = (𝑆s (𝐾(LSSum‘𝑆)((LSpan‘𝑆)‘𝑏))))
52 lmhmfgsplit.u . . . . 5 𝑈 = (𝑆s 𝐾)
53 eqid 2736 . . . . 5 (𝑆s ((LSpan‘𝑆)‘𝑏)) = (𝑆s ((LSpan‘𝑆)‘𝑏))
54 eqid 2736 . . . . 5 (𝑆s (𝐾(LSSum‘𝑆)((LSpan‘𝑆)‘𝑏))) = (𝑆s (𝐾(LSSum‘𝑆)((LSpan‘𝑆)‘𝑏)))
5526, 25, 23lmhmkerlss 20512 . . . . . . 7 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐾 ∈ (LSubSp‘𝑆))
56553ad2ant1 1133 . . . . . 6 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → 𝐾 ∈ (LSubSp‘𝑆))
5756ad2antrr 724 . . . . 5 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝐾 ∈ (LSubSp‘𝑆))
58 simpll2 1213 . . . . 5 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝑈 ∈ LFinGen)
59 inss2 4189 . . . . . . . 8 (𝒫 (Base‘𝑆) ∩ Fin) ⊆ Fin
6059sseli 3940 . . . . . . 7 (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) → 𝑏 ∈ Fin)
6160ad2antrl 726 . . . . . 6 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝑏 ∈ Fin)
6236, 13, 53islssfgi 41385 . . . . . 6 ((𝑆 ∈ LMod ∧ 𝑏 ⊆ (Base‘𝑆) ∧ 𝑏 ∈ Fin) → (𝑆s ((LSpan‘𝑆)‘𝑏)) ∈ LFinGen)
6330, 35, 61, 62syl3anc 1371 . . . . 5 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝑆s ((LSpan‘𝑆)‘𝑏)) ∈ LFinGen)
6423, 24, 52, 53, 54, 30, 57, 38, 58, 63lsmfgcl 41387 . . . 4 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → (𝑆s (𝐾(LSSum‘𝑆)((LSpan‘𝑆)‘𝑏))) ∈ LFinGen)
6551, 64eqeltrd 2838 . . 3 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) ∧ (𝑏 ∈ (𝒫 (Base‘𝑆) ∩ Fin) ∧ (𝐹𝑏) = 𝑎)) → 𝑆 ∈ LFinGen)
6622, 65rexlimddv 3158 . 2 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) ∧ (𝑎 ∈ 𝒫 ran 𝐹 ∧ (𝑎 ∈ Fin ∧ ((LSpan‘𝑇)‘𝑎) = ran 𝐹))) → 𝑆 ∈ LFinGen)
6711, 66rexlimddv 3158 1 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ LFinGen ∧ 𝑉 ∈ LFinGen) → 𝑆 ∈ LFinGen)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wrex 3073  cin 3909  wss 3910  𝒫 cpw 4560  {csn 4586  ccnv 5632  ran crn 5634  cima 5636   Fn wfn 6491  wf 6492  cfv 6496  (class class class)co 7357  Fincfn 8883  Basecbs 17083  s cress 17112  0gc0g 17321  LSSumclsm 19416  LModclmod 20322  LSubSpclss 20392  LSpanclspn 20432   LMHom clmhm 20480  LFinGenclfig 41380
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-3 12217  df-4 12218  df-5 12219  df-6 12220  df-sets 17036  df-slot 17054  df-ndx 17066  df-base 17084  df-ress 17113  df-plusg 17146  df-sca 17149  df-vsca 17150  df-0g 17323  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-submnd 18602  df-grp 18751  df-minusg 18752  df-sbg 18753  df-subg 18925  df-ghm 19006  df-cntz 19097  df-lsm 19418  df-cmn 19564  df-abl 19565  df-mgp 19897  df-ur 19914  df-ring 19966  df-lmod 20324  df-lss 20393  df-lsp 20433  df-lmhm 20483  df-lfig 41381
This theorem is referenced by:  lmhmlnmsplit  41400
  Copyright terms: Public domain W3C validator