Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lcvexchlem4 Structured version   Visualization version   GIF version

Theorem lcvexchlem4 40014
Description: Lemma for lcvexch 40016. (Contributed by NM, 10-Jan-2015.)
Hypotheses
Ref Expression
lcvexch.s 𝑆 = (LSubSp‘𝑊)
lcvexch.p ⊕ = (LSSum‘𝑊)
lcvexch.c 𝐶 = ( ⋖L ‘𝑊)
lcvexch.w (𝜑 → 𝑊 ∈ LMod)
lcvexch.t (𝜑 → 𝑇 ∈ 𝑆)
lcvexch.u (𝜑 → 𝑈 ∈ 𝑆)
lcvexch.f (𝜑 → 𝑇𝐶(𝑇 ⊕ 𝑈))
Assertion
Ref Expression
lcvexchlem4 (𝜑 → (𝑇 ∩ 𝑈)𝐶𝑈)

Proof of Theorem lcvexchlem4
Dummy variables 𝑠 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lcvexch.s . . . 4 𝑆 = (LSubSp‘𝑊)
2 lcvexch.c . . . 4 𝐶 = ( ⋖L ‘𝑊)
3 lcvexch.w . . . 4 (𝜑 → 𝑊 ∈ LMod)
4 lcvexch.t . . . 4 (𝜑 → 𝑇 ∈ 𝑆)
5 lcvexch.u . . . . 5 (𝜑 → 𝑈 ∈ 𝑆)
6 lcvexch.p . . . . . 6 ⊕ = (LSSum‘𝑊)
71, 6lsmcl 21319 . . . . 5 ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ⊕ 𝑈) ∈ 𝑆)
83, 4, 5, 7syl3anc 1398 . . . 4 (𝜑 → (𝑇 ⊕ 𝑈) ∈ 𝑆)
9 lcvexch.f . . . 4 (𝜑 → 𝑇𝐶(𝑇 ⊕ 𝑈))
101, 2, 3, 4, 8, 9lcvpss 40001 . . 3 (𝜑 → 𝑇 ⊊ (𝑇 ⊕ 𝑈))
111, 6, 2, 3, 4, 5lcvexchlem1 40011 . . 3 (𝜑 → (𝑇 ⊊ (𝑇 ⊕ 𝑈) ↔ (𝑇 ∩ 𝑈) ⊊ 𝑈))
1210, 11mpbid 235 . 2 (𝜑 → (𝑇 ∩ 𝑈) ⊊ 𝑈)
1333ad2ant1 1151 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑊 ∈ LMod)
141lsssssubg 21194 . . . . . . . . 9 (𝑊 ∈ LMod → 𝑆 ⊆ (SubGrp‘𝑊))
1513, 14syl 18 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑆 ⊆ (SubGrp‘𝑊))
16 simp2 1155 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑠 ∈ 𝑆)
1715, 16sseldd 3931 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑠 ∈ (SubGrp‘𝑊))
1843ad2ant1 1151 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇 ∈ 𝑆)
1915, 18sseldd 3931 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇 ∈ (SubGrp‘𝑊))
206lsmub2 19833 . . . . . . 7 ((𝑠 ∈ (SubGrp‘𝑊) ∧ 𝑇 ∈ (SubGrp‘𝑊)) → 𝑇 ⊆ (𝑠 ⊕ 𝑇))
2117, 19, 20syl2anc 596 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇 ⊆ (𝑠 ⊕ 𝑇))
2253ad2ant1 1151 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑈 ∈ 𝑆)
2315, 22sseldd 3931 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑈 ∈ (SubGrp‘𝑊))
24 simp3r 1221 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑠 ⊆ 𝑈)
256lsmless1 19835 . . . . . . . 8 ((𝑈 ∈ (SubGrp‘𝑊) ∧ 𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑠 ⊆ 𝑈) → (𝑠 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑇))
2623, 19, 24, 25syl3anc 1398 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑠 ⊕ 𝑇) ⊆ (𝑈 ⊕ 𝑇))
27 lmodabl 21145 . . . . . . . . . 10 (𝑊 ∈ LMod → 𝑊 ∈ Abel)
283, 27syl 18 . . . . . . . . 9 (𝜑 → 𝑊 ∈ Abel)
293, 14syl 18 . . . . . . . . . 10 (𝜑 → 𝑆 ⊆ (SubGrp‘𝑊))
3029, 4sseldd 3931 . . . . . . . . 9 (𝜑 → 𝑇 ∈ (SubGrp‘𝑊))
3129, 5sseldd 3931 . . . . . . . . 9 (𝜑 → 𝑈 ∈ (SubGrp‘𝑊))
326lsmcom 20033 . . . . . . . . 9 ((𝑊 ∈ Abel ∧ 𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))
3328, 30, 31, 32syl3anc 1398 . . . . . . . 8 (𝜑 → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))
34333ad2ant1 1151 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇))
3526, 34sseqtrrd 3967 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈))
3693ad2ant1 1151 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑇𝐶(𝑇 ⊕ 𝑈))
371, 2, 3, 4, 8lcvbr3 40000 . . . . . . . . . 10 (𝜑 → (𝑇𝐶(𝑇 ⊕ 𝑈) ↔ (𝑇 ⊊ (𝑇 ⊕ 𝑈) ∧ ∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))))))
3837adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝑆) → (𝑇𝐶(𝑇 ⊕ 𝑈) ↔ (𝑇 ⊊ (𝑇 ⊕ 𝑈) ∧ ∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))))))
393adantr 486 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑠 ∈ 𝑆) → 𝑊 ∈ LMod)
40 simpr 490 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑠 ∈ 𝑆) → 𝑠 ∈ 𝑆)
414adantr 486 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑠 ∈ 𝑆) → 𝑇 ∈ 𝑆)
421, 6lsmcl 21319 . . . . . . . . . . . 12 ((𝑊 ∈ LMod ∧ 𝑠 ∈ 𝑆 ∧ 𝑇 ∈ 𝑆) → (𝑠 ⊕ 𝑇) ∈ 𝑆)
4339, 40, 41, 42syl3anc 1398 . . . . . . . . . . 11 ((𝜑 ∧ 𝑠 ∈ 𝑆) → (𝑠 ⊕ 𝑇) ∈ 𝑆)
44 sseq2 3956 . . . . . . . . . . . . . 14 (𝑟 = (𝑠 ⊕ 𝑇) → (𝑇 ⊆ 𝑟 ↔ 𝑇 ⊆ (𝑠 ⊕ 𝑇)))
45 sseq1 3955 . . . . . . . . . . . . . 14 (𝑟 = (𝑠 ⊕ 𝑇) → (𝑟 ⊆ (𝑇 ⊕ 𝑈) ↔ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)))
4644, 45anbi12d 644 . . . . . . . . . . . . 13 (𝑟 = (𝑠 ⊕ 𝑇) → ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) ↔ (𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈))))
47 eqeq1 2764 . . . . . . . . . . . . . 14 (𝑟 = (𝑠 ⊕ 𝑇) → (𝑟 = 𝑇 ↔ (𝑠 ⊕ 𝑇) = 𝑇))
48 eqeq1 2764 . . . . . . . . . . . . . 14 (𝑟 = (𝑠 ⊕ 𝑇) → (𝑟 = (𝑇 ⊕ 𝑈) ↔ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))
4947, 48orbi12d 932 . . . . . . . . . . . . 13 (𝑟 = (𝑠 ⊕ 𝑇) → ((𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈)) ↔ ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈))))
5046, 49imbi12d 347 . . . . . . . . . . . 12 (𝑟 = (𝑠 ⊕ 𝑇) → (((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))) ↔ ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
5150rspcv 3572 . . . . . . . . . . 11 ((𝑠 ⊕ 𝑇) ∈ 𝑆 → (∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
5243, 51syl 18 . . . . . . . . . 10 ((𝜑 ∧ 𝑠 ∈ 𝑆) → (∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈))) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
5352adantld 496 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝑆) → ((𝑇 ⊊ (𝑇 ⊕ 𝑈) ∧ ∀𝑟 ∈ 𝑆 ((𝑇 ⊆ 𝑟 ∧ 𝑟 ⊆ (𝑇 ⊕ 𝑈)) → (𝑟 = 𝑇 ∨ 𝑟 = (𝑇 ⊕ 𝑈)))) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
5438, 53sylbid 243 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆) → (𝑇𝐶(𝑇 ⊕ 𝑈) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
55543adant3 1150 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑇𝐶(𝑇 ⊕ 𝑈) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))))
5636, 55mpd 16 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑇 ⊆ (𝑠 ⊕ 𝑇) ∧ (𝑠 ⊕ 𝑇) ⊆ (𝑇 ⊕ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈))))
5721, 35, 56mp2and 712 . . . . 5 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)))
58 ineq1 4158 . . . . . . 7 ((𝑠 ⊕ 𝑇) = 𝑇 → ((𝑠 ⊕ 𝑇) ∩ 𝑈) = (𝑇 ∩ 𝑈))
59 simp3l 1220 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑇 ∩ 𝑈) ⊆ 𝑠)
601, 6, 2, 13, 18, 22, 16, 59, 24lcvexchlem2 40012 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) ∩ 𝑈) = 𝑠)
6160eqeq1d 2762 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (((𝑠 ⊕ 𝑇) ∩ 𝑈) = (𝑇 ∩ 𝑈) ↔ 𝑠 = (𝑇 ∩ 𝑈)))
6258, 61imbitrid 247 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) = 𝑇 → 𝑠 = (𝑇 ∩ 𝑈)))
63 ineq1 4158 . . . . . . 7 ((𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈) → ((𝑠 ⊕ 𝑇) ∩ 𝑈) = ((𝑇 ⊕ 𝑈) ∩ 𝑈))
646lsmub2 19833 . . . . . . . . . 10 ((𝑇 ∈ (SubGrp‘𝑊) ∧ 𝑈 ∈ (SubGrp‘𝑊)) → 𝑈 ⊆ (𝑇 ⊕ 𝑈))
6519, 23, 64syl2anc 596 . . . . . . . . 9 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → 𝑈 ⊆ (𝑇 ⊕ 𝑈))
66 sseqin2 4168 . . . . . . . . 9 (𝑈 ⊆ (𝑇 ⊕ 𝑈) ↔ ((𝑇 ⊕ 𝑈) ∩ 𝑈) = 𝑈)
6765, 66sylib 221 . . . . . . . 8 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑇 ⊕ 𝑈) ∩ 𝑈) = 𝑈)
6860, 67eqeq12d 2776 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (((𝑠 ⊕ 𝑇) ∩ 𝑈) = ((𝑇 ⊕ 𝑈) ∩ 𝑈) ↔ 𝑠 = 𝑈))
6963, 68imbitrid 247 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → ((𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈) → 𝑠 = 𝑈))
7062, 69orim12d 979 . . . . 5 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (((𝑠 ⊕ 𝑇) = 𝑇 ∨ (𝑠 ⊕ 𝑇) = (𝑇 ⊕ 𝑈)) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈)))
7157, 70mpd 16 . . . 4 ((𝜑 ∧ 𝑠 ∈ 𝑆 ∧ ((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈)) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈))
72713exp 1137 . . 3 (𝜑 → (𝑠 ∈ 𝑆 → (((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈))))
7372ralrimiv 3153 . 2 (𝜑 → ∀𝑠 ∈ 𝑆 (((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈)))
741lssincl 21201 . . . 4 ((𝑊 ∈ LMod ∧ 𝑇 ∈ 𝑆 ∧ 𝑈 ∈ 𝑆) → (𝑇 ∩ 𝑈) ∈ 𝑆)
753, 4, 5, 74syl3anc 1398 . . 3 (𝜑 → (𝑇 ∩ 𝑈) ∈ 𝑆)
761, 2, 3, 75, 5lcvbr3 40000 . 2 (𝜑 → ((𝑇 ∩ 𝑈)𝐶𝑈 ↔ ((𝑇 ∩ 𝑈) ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 (((𝑇 ∩ 𝑈) ⊆ 𝑠 ∧ 𝑠 ⊆ 𝑈) → (𝑠 = (𝑇 ∩ 𝑈) ∨ 𝑠 = 𝑈)))))
7712, 73, 76mpbir2and 726 1 (𝜑 → (𝑇 ∩ 𝑈)𝐶𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ∩ cin 3897   ⊆ wss 3898   ⊊ wpss 3899   class class class wbr 5102  ‘cfv 6527  (class class class)co 7408  SubGrpcsubg 19291  LSSumclsm 19809  Abelcabl 19956  LModclmod 21096  LSubSpclss 21167   ⋖L clcv 39995
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-cnex 11227  ax-resscn 11228  ax-1cn 11229  ax-icn 11230  ax-addcl 11231  ax-addrcl 11232  ax-mulcl 11233  ax-mulrcl 11234  ax-mulcom 11235  ax-addass 11236  ax-mulass 11237  ax-distr 11238  ax-i2m1 11239  ax-1ne0 11240  ax-1rid 11241  ax-rnegex 11242  ax-rrecex 11243  ax-cnre 11244  ax-pre-lttri 11245  ax-pre-lttrn 11246  ax-pre-ltadd 11247  ax-pre-mulgt0 11248
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-2o 8455  df-er 8695  df-en 8952  df-dom 8953  df-sdom 8954  df-fin 8955  df-pnf 11316  df-mnf 11317  df-xr 11318  df-ltxr 11319  df-le 11320  df-sub 11514  df-neg 11515  df-nn 12305  df-2 12374  df-sets 17303  df-slot 17321  df-ndx 17333  df-base 17349  df-ress 17370  df-plusg 17402  df-0g 17573  df-mre 17717  df-mrc 17718  df-acs 17720  df-mgm 18777  df-sgrp 18869  df-mnd 18885  df-submnd 18940  df-grp 19108  df-minusg 19109  df-sbg 19110  df-subg 19294  df-cntz 19492  df-lsm 19811  df-cmn 19957  df-abl 19958  df-mgp 20322  df-ur 20369  df-ring 20422  df-lmod 21098  df-lss 21168  df-lcv 39996
This theorem is used by:  lcvexch  40016  lsatcvat3  40029
  Copyright terms: Public domain W3C validator