pwssplit4 - Mathbox for Stefan O'Rear

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

Theorem pwssplit4 43051

Description: Splitting for structure powers 4: maps isomorphically onto the other half. (Contributed by Stefan O'Rear, 25-Jan-2015.)

**Hypotheses**
Ref	Expression
pwssplit4.e	⊢ 𝐸 = (𝑅 ↑_s (𝐴 ∪ 𝐵))
pwssplit4.g	⊢ 𝐺 = (Base‘𝐸)
pwssplit4.z	⊢ 0 = (0_g‘𝑅)
pwssplit4.k	⊢ 𝐾 = {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (𝐴 × { 0 })}
pwssplit4.f	⊢ 𝐹 = (𝑥 ∈ 𝐾 ↦ (𝑥 ↾ 𝐵))
pwssplit4.c	⊢ 𝐶 = (𝑅 ↑_s 𝐴)
pwssplit4.d	⊢ 𝐷 = (𝑅 ↑_s 𝐵)
pwssplit4.l	⊢ 𝐿 = (𝐸 ↾_s 𝐾)

**Assertion**
Ref	Expression
pwssplit4	⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹 ∈ (𝐿 LMIso 𝐷))

Distinct variable groups: 𝑥,𝐴,𝑦 𝑥,𝐵,𝑦 𝑥,𝐶,𝑦 𝑥,𝐷,𝑦 𝑥,𝐸,𝑦 𝑥,𝐺,𝑦 𝑥,𝐾 𝑥,𝐿 𝑥,𝑅,𝑦 𝑥,𝑉,𝑦 𝑥, 0 ,𝑦 Allowed substitution hints: 𝐹(𝑥,𝑦) 𝐾(𝑦) 𝐿(𝑦)

Proof of Theorem pwssplit4 Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pwssplit4.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐾 ↦ (𝑥 ↾ 𝐵))
2		pwssplit4.k	. . . . . 6 ⊢ 𝐾 = {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (𝐴 × { 0 })}
3		ssrab2 4039	. . . . . 6 ⊢ {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (𝐴 × { 0 })} ⊆ 𝐺
4	2, 3	eqsstri 3990	. . . . 5 ⊢ 𝐾 ⊆ 𝐺
5		resmpt 5997	. . . . 5 ⊢ (𝐾 ⊆ 𝐺 → ((𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ↾ 𝐾) = (𝑥 ∈ 𝐾 ↦ (𝑥 ↾ 𝐵)))
6	4, 5	ax-mp 5	. . . 4 ⊢ ((𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ↾ 𝐾) = (𝑥 ∈ 𝐾 ↦ (𝑥 ↾ 𝐵))
7	1, 6	eqtr4i 2755	. . 3 ⊢ 𝐹 = ((𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ↾ 𝐾)
8		ssun2 4138	. . . . . 6 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵)
9	8	a1i 11	. . . . 5 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ⊆ (𝐴 ∪ 𝐵))
10		pwssplit4.e	. . . . . 6 ⊢ 𝐸 = (𝑅 ↑_s (𝐴 ∪ 𝐵))
11		pwssplit4.d	. . . . . 6 ⊢ 𝐷 = (𝑅 ↑_s 𝐵)
12		pwssplit4.g	. . . . . 6 ⊢ 𝐺 = (Base‘𝐸)
13		eqid 2729	. . . . . 6 ⊢ (Base‘𝐷) = (Base‘𝐷)
14		eqid 2729	. . . . . 6 ⊢ (𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) = (𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵))
15	10, 11, 12, 13, 14	pwssplit3 20944	. . . . 5 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ 𝐵 ⊆ (𝐴 ∪ 𝐵)) → (𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ∈ (𝐸 LMHom 𝐷))
16	9, 15	syld3an3 1411	. . . 4 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ∈ (𝐸 LMHom 𝐷))
17		simp1 1136	. . . . . . . . . 10 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝑅 ∈ LMod)
18		lmodgrp 20749	. . . . . . . . . 10 ⊢ (𝑅 ∈ LMod → 𝑅 ∈ Grp)
19		grpmnd 18848	. . . . . . . . . 10 ⊢ (𝑅 ∈ Grp → 𝑅 ∈ Mnd)
20	17, 18, 19	3syl 18	. . . . . . . . 9 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝑅 ∈ Mnd)
21		ssun1 4137	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵)
22		ssexg 5273	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ 𝑉) → 𝐴 ∈ V)
23	21, 22	mpan 690	. . . . . . . . . 10 ⊢ ((𝐴 ∪ 𝐵) ∈ 𝑉 → 𝐴 ∈ V)
24	23	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ∈ V)
25		pwssplit4.c	. . . . . . . . . 10 ⊢ 𝐶 = (𝑅 ↑_s 𝐴)
26		pwssplit4.z	. . . . . . . . . 10 ⊢ 0 = (0_g‘𝑅)
27	25, 26	pws0g 18676	. . . . . . . . 9 ⊢ ((𝑅 ∈ Mnd ∧ 𝐴 ∈ V) → (𝐴 × { 0 }) = (0_g‘𝐶))
28	20, 24, 27	syl2anc 584	. . . . . . . 8 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 × { 0 }) = (0_g‘𝐶))
29	28	eqeq2d 2740	. . . . . . 7 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝑦 ↾ 𝐴) = (𝐴 × { 0 }) ↔ (𝑦 ↾ 𝐴) = (0_g‘𝐶)))
30	29	rabbidv 3410	. . . . . 6 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (𝐴 × { 0 })} = {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)})
31	2, 30	eqtrid 2776	. . . . 5 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐾 = {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)})
32	21	a1i 11	. . . . . . 7 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ⊆ (𝐴 ∪ 𝐵))
33		eqid 2729	. . . . . . . 8 ⊢ (Base‘𝐶) = (Base‘𝐶)
34		eqid 2729	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) = (𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴))
35	10, 25, 12, 33, 34	pwssplit3 20944	. . . . . . 7 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ 𝐴 ⊆ (𝐴 ∪ 𝐵)) → (𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) ∈ (𝐸 LMHom 𝐶))
36	32, 35	syld3an3 1411	. . . . . 6 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) ∈ (𝐸 LMHom 𝐶))
37		fvex 6853	. . . . . . . . 9 ⊢ (0_g‘𝐶) ∈ V
38	34	mptiniseg 6200	. . . . . . . . 9 ⊢ ((0_g‘𝐶) ∈ V → (^◡(𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) “ {(0_g‘𝐶)}) = {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)})
39	37, 38	ax-mp 5	. . . . . . . 8 ⊢ (^◡(𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) “ {(0_g‘𝐶)}) = {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)}
40	39	eqcomi 2738	. . . . . . 7 ⊢ {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)} = (^◡(𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) “ {(0_g‘𝐶)})
41		eqid 2729	. . . . . . 7 ⊢ (0_g‘𝐶) = (0_g‘𝐶)
42		eqid 2729	. . . . . . 7 ⊢ (LSubSp‘𝐸) = (LSubSp‘𝐸)
43	40, 41, 42	lmhmkerlss 20934	. . . . . 6 ⊢ ((𝑦 ∈ 𝐺 ↦ (𝑦 ↾ 𝐴)) ∈ (𝐸 LMHom 𝐶) → {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)} ∈ (LSubSp‘𝐸))
44	36, 43	syl 17	. . . . 5 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → {𝑦 ∈ 𝐺 ∣ (𝑦 ↾ 𝐴) = (0_g‘𝐶)} ∈ (LSubSp‘𝐸))
45	31, 44	eqeltrd 2828	. . . 4 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐾 ∈ (LSubSp‘𝐸))
46		pwssplit4.l	. . . . 5 ⊢ 𝐿 = (𝐸 ↾_s 𝐾)
47	42, 46	reslmhm 20935	. . . 4 ⊢ (((𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ∈ (𝐸 LMHom 𝐷) ∧ 𝐾 ∈ (LSubSp‘𝐸)) → ((𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ↾ 𝐾) ∈ (𝐿 LMHom 𝐷))
48	16, 45, 47	syl2anc 584	. . 3 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝑥 ∈ 𝐺 ↦ (𝑥 ↾ 𝐵)) ↾ 𝐾) ∈ (𝐿 LMHom 𝐷))
49	7, 48	eqeltrid 2832	. 2 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹 ∈ (𝐿 LMHom 𝐷))
50	1	fvtresfn 6952	. . . . . . 7 ⊢ (𝑎 ∈ 𝐾 → (𝐹‘𝑎) = (𝑎 ↾ 𝐵))
51		ssexg 5273	. . . . . . . . . . 11 ⊢ ((𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ 𝑉) → 𝐵 ∈ V)
52	8, 51	mpan 690	. . . . . . . . . 10 ⊢ ((𝐴 ∪ 𝐵) ∈ 𝑉 → 𝐵 ∈ V)
53	52	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ∈ V)
54	11, 26	pws0g 18676	. . . . . . . . 9 ⊢ ((𝑅 ∈ Mnd ∧ 𝐵 ∈ V) → (𝐵 × { 0 }) = (0_g‘𝐷))
55	20, 53, 54	syl2anc 584	. . . . . . . 8 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐵 × { 0 }) = (0_g‘𝐷))
56	55	eqcomd 2735	. . . . . . 7 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (0_g‘𝐷) = (𝐵 × { 0 }))
57	50, 56	eqeqan12rd 2744	. . . . . 6 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ 𝐾) → ((𝐹‘𝑎) = (0_g‘𝐷) ↔ (𝑎 ↾ 𝐵) = (𝐵 × { 0 })))
58		reseq1 5933	. . . . . . . . . 10 ⊢ (𝑦 = 𝑎 → (𝑦 ↾ 𝐴) = (𝑎 ↾ 𝐴))
59	58	eqeq1d 2731	. . . . . . . . 9 ⊢ (𝑦 = 𝑎 → ((𝑦 ↾ 𝐴) = (𝐴 × { 0 }) ↔ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })))
60	59, 2	elrab2 3659	. . . . . . . 8 ⊢ (𝑎 ∈ 𝐾 ↔ (𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })))
61		uneq12 4122	. . . . . . . . . . . . 13 ⊢ (((𝑎 ↾ 𝐴) = (𝐴 × { 0 }) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 })) → ((𝑎 ↾ 𝐴) ∪ (𝑎 ↾ 𝐵)) = ((𝐴 × { 0 }) ∪ (𝐵 × { 0 })))
62		resundi 5953	. . . . . . . . . . . . 13 ⊢ (𝑎 ↾ (𝐴 ∪ 𝐵)) = ((𝑎 ↾ 𝐴) ∪ (𝑎 ↾ 𝐵))
63		xpundir 5701	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∪ 𝐵) × { 0 }) = ((𝐴 × { 0 }) ∪ (𝐵 × { 0 }))
64	61, 62, 63	3eqtr4g 2789	. . . . . . . . . . . 12 ⊢ (((𝑎 ↾ 𝐴) = (𝐴 × { 0 }) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 })) → (𝑎 ↾ (𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) × { 0 }))
65	64	adantll 714	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 })) → (𝑎 ↾ (𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) × { 0 }))
66	65	adantl 481	. . . . . . . . . 10 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → (𝑎 ↾ (𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) × { 0 }))
67		eqid 2729	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) = (Base‘𝑅)
68		simpl1 1192	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → 𝑅 ∈ LMod)
69		simp2 1137	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∪ 𝐵) ∈ 𝑉)
70	69	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → (𝐴 ∪ 𝐵) ∈ 𝑉)
71		simprll 778	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → 𝑎 ∈ 𝐺)
72	10, 67, 12, 68, 70, 71	pwselbas 17428	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → 𝑎:(𝐴 ∪ 𝐵)⟶(Base‘𝑅))
73		ffn 6670	. . . . . . . . . . 11 ⊢ (𝑎:(𝐴 ∪ 𝐵)⟶(Base‘𝑅) → 𝑎 Fn (𝐴 ∪ 𝐵))
74		fnresdm 6619	. . . . . . . . . . 11 ⊢ (𝑎 Fn (𝐴 ∪ 𝐵) → (𝑎 ↾ (𝐴 ∪ 𝐵)) = 𝑎)
75	72, 73, 74	3syl 18	. . . . . . . . . 10 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → (𝑎 ↾ (𝐴 ∪ 𝐵)) = 𝑎)
76	10, 26	pws0g 18676	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Mnd ∧ (𝐴 ∪ 𝐵) ∈ 𝑉) → ((𝐴 ∪ 𝐵) × { 0 }) = (0_g‘𝐸))
77	20, 69, 76	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐴 ∪ 𝐵) × { 0 }) = (0_g‘𝐸))
78	10	pwslmod 20852	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉) → 𝐸 ∈ LMod)
79	78	3adant3 1132	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐸 ∈ LMod)
80	42	lsssubg 20839	. . . . . . . . . . . . . 14 ⊢ ((𝐸 ∈ LMod ∧ 𝐾 ∈ (LSubSp‘𝐸)) → 𝐾 ∈ (SubGrp‘𝐸))
81	79, 45, 80	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐾 ∈ (SubGrp‘𝐸))
82		eqid 2729	. . . . . . . . . . . . . 14 ⊢ (0_g‘𝐸) = (0_g‘𝐸)
83	46, 82	subg0 19040	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ (SubGrp‘𝐸) → (0_g‘𝐸) = (0_g‘𝐿))
84	81, 83	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (0_g‘𝐸) = (0_g‘𝐿))
85	77, 84	eqtrd 2764	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐴 ∪ 𝐵) × { 0 }) = (0_g‘𝐿))
86	85	adantr 480	. . . . . . . . . 10 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → ((𝐴 ∪ 𝐵) × { 0 }) = (0_g‘𝐿))
87	66, 75, 86	3eqtr3d 2772	. . . . . . . . 9 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) ∧ (𝑎 ↾ 𝐵) = (𝐵 × { 0 }))) → 𝑎 = (0_g‘𝐿))
88	87	exp32 420	. . . . . . . 8 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝑎 ∈ 𝐺 ∧ (𝑎 ↾ 𝐴) = (𝐴 × { 0 })) → ((𝑎 ↾ 𝐵) = (𝐵 × { 0 }) → 𝑎 = (0_g‘𝐿))))
89	60, 88	biimtrid 242	. . . . . . 7 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝑎 ∈ 𝐾 → ((𝑎 ↾ 𝐵) = (𝐵 × { 0 }) → 𝑎 = (0_g‘𝐿))))
90	89	imp 406	. . . . . 6 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ 𝐾) → ((𝑎 ↾ 𝐵) = (𝐵 × { 0 }) → 𝑎 = (0_g‘𝐿)))
91	57, 90	sylbid 240	. . . . 5 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ 𝐾) → ((𝐹‘𝑎) = (0_g‘𝐷) → 𝑎 = (0_g‘𝐿)))
92	91	ralrimiva 3125	. . . 4 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ∀𝑎 ∈ 𝐾 ((𝐹‘𝑎) = (0_g‘𝐷) → 𝑎 = (0_g‘𝐿)))
93		lmghm 20914	. . . . 5 ⊢ (𝐹 ∈ (𝐿 LMHom 𝐷) → 𝐹 ∈ (𝐿 GrpHom 𝐷))
94	46, 12	ressbas2 17184	. . . . . . 7 ⊢ (𝐾 ⊆ 𝐺 → 𝐾 = (Base‘𝐿))
95	4, 94	ax-mp 5	. . . . . 6 ⊢ 𝐾 = (Base‘𝐿)
96		eqid 2729	. . . . . 6 ⊢ (0_g‘𝐿) = (0_g‘𝐿)
97		eqid 2729	. . . . . 6 ⊢ (0_g‘𝐷) = (0_g‘𝐷)
98	95, 13, 96, 97	ghmf1 19154	. . . . 5 ⊢ (𝐹 ∈ (𝐿 GrpHom 𝐷) → (𝐹:𝐾–1-1→(Base‘𝐷) ↔ ∀𝑎 ∈ 𝐾 ((𝐹‘𝑎) = (0_g‘𝐷) → 𝑎 = (0_g‘𝐿))))
99	49, 93, 98	3syl 18	. . . 4 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹:𝐾–1-1→(Base‘𝐷) ↔ ∀𝑎 ∈ 𝐾 ((𝐹‘𝑎) = (0_g‘𝐷) → 𝑎 = (0_g‘𝐿))))
100	92, 99	mpbird 257	. . 3 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹:𝐾–1-1→(Base‘𝐷))
101		eqid 2729	. . . . . 6 ⊢ (Base‘𝐿) = (Base‘𝐿)
102	101, 13	lmhmf 20917	. . . . 5 ⊢ (𝐹 ∈ (𝐿 LMHom 𝐷) → 𝐹:(Base‘𝐿)⟶(Base‘𝐷))
103		frn 6677	. . . . 5 ⊢ (𝐹:(Base‘𝐿)⟶(Base‘𝐷) → ran 𝐹 ⊆ (Base‘𝐷))
104	49, 102, 103	3syl 18	. . . 4 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ran 𝐹 ⊆ (Base‘𝐷))
105		reseq1 5933	. . . . . . 7 ⊢ (𝑥 = (𝑎 ∪ (𝐴 × { 0 })) → (𝑥 ↾ 𝐵) = ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐵))
106	11, 67, 13	pwselbasb 17427	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ LMod ∧ 𝐵 ∈ V) → (𝑎 ∈ (Base‘𝐷) ↔ 𝑎:𝐵⟶(Base‘𝑅)))
107	17, 53, 106	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝑎 ∈ (Base‘𝐷) ↔ 𝑎:𝐵⟶(Base‘𝑅)))
108	107	biimpa 476	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → 𝑎:𝐵⟶(Base‘𝑅))
109	26	fvexi 6854	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
110	109	fconst 6728	. . . . . . . . . . . . 13 ⊢ (𝐴 × { 0 }):𝐴⟶{ 0 }
111	110	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐴 × { 0 }):𝐴⟶{ 0 })
112	20	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → 𝑅 ∈ Mnd)
113	67, 26	mndidcl 18652	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ Mnd → 0 ∈ (Base‘𝑅))
114	112, 113	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → 0 ∈ (Base‘𝑅))
115	114	snssd 4769	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → { 0 } ⊆ (Base‘𝑅))
116	111, 115	fssd 6687	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐴 × { 0 }):𝐴⟶(Base‘𝑅))
117		incom 4168	. . . . . . . . . . . . 13 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵)
118		simp3 1138	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∩ 𝐵) = ∅)
119	117, 118	eqtrid 2776	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐵 ∩ 𝐴) = ∅)
120	119	adantr 480	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐵 ∩ 𝐴) = ∅)
121		fun 6704	. . . . . . . . . . 11 ⊢ (((𝑎:𝐵⟶(Base‘𝑅) ∧ (𝐴 × { 0 }):𝐴⟶(Base‘𝑅)) ∧ (𝐵 ∩ 𝐴) = ∅) → (𝑎 ∪ (𝐴 × { 0 })):(𝐵 ∪ 𝐴)⟶((Base‘𝑅) ∪ (Base‘𝑅)))
122	108, 116, 120, 121	syl21anc 837	. . . . . . . . . 10 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝑎 ∪ (𝐴 × { 0 })):(𝐵 ∪ 𝐴)⟶((Base‘𝑅) ∪ (Base‘𝑅)))
123		uncom 4117	. . . . . . . . . . 11 ⊢ (𝐵 ∪ 𝐴) = (𝐴 ∪ 𝐵)
124		unidm 4116	. . . . . . . . . . 11 ⊢ ((Base‘𝑅) ∪ (Base‘𝑅)) = (Base‘𝑅)
125	123, 124	feq23i 6664	. . . . . . . . . 10 ⊢ ((𝑎 ∪ (𝐴 × { 0 })):(𝐵 ∪ 𝐴)⟶((Base‘𝑅) ∪ (Base‘𝑅)) ↔ (𝑎 ∪ (𝐴 × { 0 })):(𝐴 ∪ 𝐵)⟶(Base‘𝑅))
126	122, 125	sylib 218	. . . . . . . . 9 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝑎 ∪ (𝐴 × { 0 })):(𝐴 ∪ 𝐵)⟶(Base‘𝑅))
127	10, 67, 12	pwselbasb 17427	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉) → ((𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐺 ↔ (𝑎 ∪ (𝐴 × { 0 })):(𝐴 ∪ 𝐵)⟶(Base‘𝑅)))
128	127	3adant3 1132	. . . . . . . . . 10 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐺 ↔ (𝑎 ∪ (𝐴 × { 0 })):(𝐴 ∪ 𝐵)⟶(Base‘𝑅)))
129	128	adantr 480	. . . . . . . . 9 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐺 ↔ (𝑎 ∪ (𝐴 × { 0 })):(𝐴 ∪ 𝐵)⟶(Base‘𝑅)))
130	126, 129	mpbird 257	. . . . . . . 8 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐺)
131		simpl3 1194	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐴 ∩ 𝐵) = ∅)
132	117, 131	eqtrid 2776	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐵 ∩ 𝐴) = ∅)
133		ffn 6670	. . . . . . . . . . . 12 ⊢ (𝑎:𝐵⟶(Base‘𝑅) → 𝑎 Fn 𝐵)
134		fnresdisj 6620	. . . . . . . . . . . 12 ⊢ (𝑎 Fn 𝐵 → ((𝐵 ∩ 𝐴) = ∅ ↔ (𝑎 ↾ 𝐴) = ∅))
135	108, 133, 134	3syl 18	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝐵 ∩ 𝐴) = ∅ ↔ (𝑎 ↾ 𝐴) = ∅))
136	132, 135	mpbid 232	. . . . . . . . . 10 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝑎 ↾ 𝐴) = ∅)
137		fnconstg 6730	. . . . . . . . . . . 12 ⊢ ( 0 ∈ V → (𝐴 × { 0 }) Fn 𝐴)
138		fnresdm 6619	. . . . . . . . . . . 12 ⊢ ((𝐴 × { 0 }) Fn 𝐴 → ((𝐴 × { 0 }) ↾ 𝐴) = (𝐴 × { 0 }))
139	109, 137, 138	mp2b 10	. . . . . . . . . . 11 ⊢ ((𝐴 × { 0 }) ↾ 𝐴) = (𝐴 × { 0 })
140	139	a1i 11	. . . . . . . . . 10 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝐴 × { 0 }) ↾ 𝐴) = (𝐴 × { 0 }))
141	136, 140	uneq12d 4128	. . . . . . . . 9 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ↾ 𝐴) ∪ ((𝐴 × { 0 }) ↾ 𝐴)) = (∅ ∪ (𝐴 × { 0 })))
142		resundir 5954	. . . . . . . . 9 ⊢ ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐴) = ((𝑎 ↾ 𝐴) ∪ ((𝐴 × { 0 }) ↾ 𝐴))
143		uncom 4117	. . . . . . . . . 10 ⊢ (∅ ∪ (𝐴 × { 0 })) = ((𝐴 × { 0 }) ∪ ∅)
144		un0 4353	. . . . . . . . . 10 ⊢ ((𝐴 × { 0 }) ∪ ∅) = (𝐴 × { 0 })
145	143, 144	eqtr2i 2753	. . . . . . . . 9 ⊢ (𝐴 × { 0 }) = (∅ ∪ (𝐴 × { 0 }))
146	141, 142, 145	3eqtr4g 2789	. . . . . . . 8 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐴) = (𝐴 × { 0 }))
147		reseq1 5933	. . . . . . . . . 10 ⊢ (𝑦 = (𝑎 ∪ (𝐴 × { 0 })) → (𝑦 ↾ 𝐴) = ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐴))
148	147	eqeq1d 2731	. . . . . . . . 9 ⊢ (𝑦 = (𝑎 ∪ (𝐴 × { 0 })) → ((𝑦 ↾ 𝐴) = (𝐴 × { 0 }) ↔ ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐴) = (𝐴 × { 0 })))
149	148, 2	elrab2 3659	. . . . . . . 8 ⊢ ((𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐾 ↔ ((𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐺 ∧ ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐴) = (𝐴 × { 0 })))
150	130, 146, 149	sylanbrc 583	. . . . . . 7 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐾)
151	130	resexd 5988	. . . . . . 7 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐵) ∈ V)
152	1, 105, 150, 151	fvmptd3 6973	. . . . . 6 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐹‘(𝑎 ∪ (𝐴 × { 0 }))) = ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐵))
153		resundir 5954	. . . . . . 7 ⊢ ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐵) = ((𝑎 ↾ 𝐵) ∪ ((𝐴 × { 0 }) ↾ 𝐵))
154		fnresdm 6619	. . . . . . . . . 10 ⊢ (𝑎 Fn 𝐵 → (𝑎 ↾ 𝐵) = 𝑎)
155	108, 133, 154	3syl 18	. . . . . . . . 9 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝑎 ↾ 𝐵) = 𝑎)
156		ffn 6670	. . . . . . . . . . . . 13 ⊢ ((𝐴 × { 0 }):𝐴⟶{ 0 } → (𝐴 × { 0 }) Fn 𝐴)
157		fnresdisj 6620	. . . . . . . . . . . . 13 ⊢ ((𝐴 × { 0 }) Fn 𝐴 → ((𝐴 ∩ 𝐵) = ∅ ↔ ((𝐴 × { 0 }) ↾ 𝐵) = ∅))
158	110, 156, 157	mp2b 10	. . . . . . . . . . . 12 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ((𝐴 × { 0 }) ↾ 𝐵) = ∅)
159	158	biimpi 216	. . . . . . . . . . 11 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 × { 0 }) ↾ 𝐵) = ∅)
160	159	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐴 × { 0 }) ↾ 𝐵) = ∅)
161	160	adantr 480	. . . . . . . . 9 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝐴 × { 0 }) ↾ 𝐵) = ∅)
162	155, 161	uneq12d 4128	. . . . . . . 8 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ↾ 𝐵) ∪ ((𝐴 × { 0 }) ↾ 𝐵)) = (𝑎 ∪ ∅))
163		un0 4353	. . . . . . . 8 ⊢ (𝑎 ∪ ∅) = 𝑎
164	162, 163	eqtrdi 2780	. . . . . . 7 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ↾ 𝐵) ∪ ((𝐴 × { 0 }) ↾ 𝐵)) = 𝑎)
165	153, 164	eqtrid 2776	. . . . . 6 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → ((𝑎 ∪ (𝐴 × { 0 })) ↾ 𝐵) = 𝑎)
166	152, 165	eqtrd 2764	. . . . 5 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐹‘(𝑎 ∪ (𝐴 × { 0 }))) = 𝑎)
167	95, 13	lmhmf 20917	. . . . . . . 8 ⊢ (𝐹 ∈ (𝐿 LMHom 𝐷) → 𝐹:𝐾⟶(Base‘𝐷))
168		ffn 6670	. . . . . . . 8 ⊢ (𝐹:𝐾⟶(Base‘𝐷) → 𝐹 Fn 𝐾)
169	49, 167, 168	3syl 18	. . . . . . 7 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹 Fn 𝐾)
170	169	adantr 480	. . . . . 6 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → 𝐹 Fn 𝐾)
171		fnfvelrn 7034	. . . . . 6 ⊢ ((𝐹 Fn 𝐾 ∧ (𝑎 ∪ (𝐴 × { 0 })) ∈ 𝐾) → (𝐹‘(𝑎 ∪ (𝐴 × { 0 }))) ∈ ran 𝐹)
172	170, 150, 171	syl2anc 584	. . . . 5 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → (𝐹‘(𝑎 ∪ (𝐴 × { 0 }))) ∈ ran 𝐹)
173	166, 172	eqeltrrd 2829	. . . 4 ⊢ (((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑎 ∈ (Base‘𝐷)) → 𝑎 ∈ ran 𝐹)
174	104, 173	eqelssd 3965	. . 3 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → ran 𝐹 = (Base‘𝐷))
175		dff1o5 6791	. . 3 ⊢ (𝐹:𝐾–1-1-onto→(Base‘𝐷) ↔ (𝐹:𝐾–1-1→(Base‘𝐷) ∧ ran 𝐹 = (Base‘𝐷)))
176	100, 174, 175	sylanbrc 583	. 2 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹:𝐾–1-1-onto→(Base‘𝐷))
177	95, 13	islmim 20945	. 2 ⊢ (𝐹 ∈ (𝐿 LMIso 𝐷) ↔ (𝐹 ∈ (𝐿 LMHom 𝐷) ∧ 𝐹:𝐾–1-1-onto→(Base‘𝐷)))
178	49, 176, 177	sylanbrc 583	1 ⊢ ((𝑅 ∈ LMod ∧ (𝐴 ∪ 𝐵) ∈ 𝑉 ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐹 ∈ (𝐿 LMIso 𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3044 {crab 3402 Vcvv 3444 ∪ cun 3909 ∩ cin 3910 ⊆ wss 3911 ∅c0 4292 {csn 4585 ↦ cmpt 5183 × cxp 5629 ^◡ccnv 5630 ran crn 5632 ↾ cres 5633 “ cima 5634 Fn wfn 6494 ⟶wf 6495 –1-1→wf1 6496 –1-1-onto→wf1o 6498 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 ↾_s cress 17176 0_gc0g 17378 ↑_s cpws 17385 Mndcmnd 18637 Grpcgrp 18841 SubGrpcsubg 19028 GrpHom cghm 19120 LModclmod 20742 LSubSpclss 20813 LMHom clmhm 20902 LMIso clmim 20903

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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-of 7633 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-er 8648 df-map 8778 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9369 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-z 12506 df-dec 12626 df-uz 12770 df-fz 13445 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-sca 17212 df-vsca 17213 df-ip 17214 df-tset 17215 df-ple 17216 df-ds 17218 df-hom 17220 df-cco 17221 df-0g 17380 df-prds 17386 df-pws 17388 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-grp 18844 df-minusg 18845 df-sbg 18846 df-subg 19031 df-ghm 19121 df-cmn 19688 df-abl 19689 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-lmod 20744 df-lss 20814 df-lmhm 20905 df-lmim 20906

This theorem is referenced by: pwslnmlem2 43055

W3C validator