Theorem lfl1dim2N 33427

Description: Equivalent expressions for a 1-dim subspace (ray) of functionals. TODO: delete this if not useful; lfl1dim 33426 may be more compatible with lspsn 18823. (Contributed by NM, 24-Oct-2014.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lfl1dim.v	⊢ 𝑉 = (Base‘𝑊)
lfl1dim.d	⊢ 𝐷 = (Scalar‘𝑊)
lfl1dim.f	⊢ 𝐹 = (LFnl‘𝑊)
lfl1dim.l	⊢ 𝐿 = (LKer‘𝑊)
lfl1dim.k	⊢ 𝐾 = (Base‘𝐷)
lfl1dim.t	⊢ · = (.r‘𝐷)
lfl1dim.w	⊢ (𝜑 → 𝑊 ∈ LVec)
lfl1dim.g	⊢ (𝜑 → 𝐺 ∈ 𝐹)

Assertion

Ref	Expression
lfl1dim2N	⊢ (𝜑 → {𝑔 ∈ 𝐹 ∣ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)} = {𝑔 ∈ 𝐹 ∣ ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))})

Distinct variable groups:   𝐷,𝑘   𝑘,𝐹   𝑘,𝐺   𝑘,𝐾   𝑘,𝐿   𝑘,𝑉   𝑘,𝑊   𝑔,𝑘,𝜑   · ,𝑘

Allowed substitution hints:   𝐷(𝑔)   · (𝑔)   𝐹(𝑔)   𝐺(𝑔)   𝐾(𝑔)   𝐿(𝑔)   𝑉(𝑔)   𝑊(𝑔)

Proof of Theorem lfl1dim2N

Step	Hyp	Ref	Expression
1		lfl1dim.w	. . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ LVec)
2		lveclmod 18927	. . . . . . . . 9 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ LMod)
4		lfl1dim.d	. . . . . . . . 9 ⊢ 𝐷 = (Scalar‘𝑊)
5		lfl1dim.k	. . . . . . . . 9 ⊢ 𝐾 = (Base‘𝐷)
6		eqid 2610	. . . . . . . . 9 ⊢ (0g‘𝐷) = (0g‘𝐷)
7	4, 5, 6	lmod0cl 18712	. . . . . . . 8 ⊢ (𝑊 ∈ LMod → (0g‘𝐷) ∈ 𝐾)
8	3, 7	syl 17	. . . . . . 7 ⊢ (𝜑 → (0g‘𝐷) ∈ 𝐾)
9	8	ad2antrr 758	. . . . . 6 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → (0g‘𝐷) ∈ 𝐾)
10		simpr 476	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → 𝑔 = (𝑉 × {(0g‘𝐷)}))
11		lfl1dim.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
12		lfl1dim.f	. . . . . . . 8 ⊢ 𝐹 = (LFnl‘𝑊)
13		lfl1dim.t	. . . . . . . 8 ⊢ · = (.r‘𝐷)
14	3	ad2antrr 758	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → 𝑊 ∈ LMod)
15		lfl1dim.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
16	15	ad2antrr 758	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → 𝐺 ∈ 𝐹)
17	11, 4, 12, 5, 13, 6, 14, 16	lfl0sc 33387	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)})) = (𝑉 × {(0g‘𝐷)}))
18	10, 17	eqtr4d 2647	. . . . . 6 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)})))
19		sneq 4135	. . . . . . . . . 10 ⊢ (𝑘 = (0g‘𝐷) → {𝑘} = {(0g‘𝐷)})
20	19	xpeq2d 5063	. . . . . . . . 9 ⊢ (𝑘 = (0g‘𝐷) → (𝑉 × {𝑘}) = (𝑉 × {(0g‘𝐷)}))
21	20	oveq2d 6565	. . . . . . . 8 ⊢ (𝑘 = (0g‘𝐷) → (𝐺 ∘𝑓 · (𝑉 × {𝑘})) = (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)})))
22	21	eqeq2d 2620	. . . . . . 7 ⊢ (𝑘 = (0g‘𝐷) → (𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})) ↔ 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)}))))
23	22	rspcev 3282	. . . . . 6 ⊢ (((0g‘𝐷) ∈ 𝐾 ∧ 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)}))) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})))
24	9, 18, 23	syl2anc 691	. . . . 5 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})))
25	24	a1d 25	. . . 4 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑔 = (𝑉 × {(0g‘𝐷)})) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
26	8	ad3antrrr 762	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → (0g‘𝐷) ∈ 𝐾)
27		lfl1dim.l	. . . . . . . . . 10 ⊢ 𝐿 = (LKer‘𝑊)
28	3	ad3antrrr 762	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → 𝑊 ∈ LMod)
29		simpllr 795	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → 𝑔 ∈ 𝐹)
30	11, 12, 27, 28, 29	lkrssv 33401	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → (𝐿‘𝑔) ⊆ 𝑉)
31	3	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → 𝑊 ∈ LMod)
32	15	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → 𝐺 ∈ 𝐹)
33	4, 6, 11, 12, 27	lkr0f 33399	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐿‘𝐺) = 𝑉 ↔ 𝐺 = (𝑉 × {(0g‘𝐷)})))
34	31, 32, 33	syl2anc 691	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → ((𝐿‘𝐺) = 𝑉 ↔ 𝐺 = (𝑉 × {(0g‘𝐷)})))
35	34	biimpar 501	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) → (𝐿‘𝐺) = 𝑉)
36	35	sseq1d 3595	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) ↔ 𝑉 ⊆ (𝐿‘𝑔)))
37	36	biimpa 500	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → 𝑉 ⊆ (𝐿‘𝑔))
38	30, 37	eqssd 3585	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → (𝐿‘𝑔) = 𝑉)
39	4, 6, 11, 12, 27	lkr0f 33399	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑔 ∈ 𝐹) → ((𝐿‘𝑔) = 𝑉 ↔ 𝑔 = (𝑉 × {(0g‘𝐷)})))
40	28, 29, 39	syl2anc 691	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → ((𝐿‘𝑔) = 𝑉 ↔ 𝑔 = (𝑉 × {(0g‘𝐷)})))
41	38, 40	mpbid 221	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → 𝑔 = (𝑉 × {(0g‘𝐷)}))
42	15	ad3antrrr 762	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → 𝐺 ∈ 𝐹)
43	11, 4, 12, 5, 13, 6, 28, 42	lfl0sc 33387	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)})) = (𝑉 × {(0g‘𝐷)}))
44	41, 43	eqtr4d 2647	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {(0g‘𝐷)})))
45	26, 44, 23	syl2anc 691	. . . . 5 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) ∧ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})))
46	45	ex 449	. . . 4 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝐺 = (𝑉 × {(0g‘𝐷)})) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
47		eqid 2610	. . . . . 6 ⊢ (LSHyp‘𝑊) = (LSHyp‘𝑊)
48	1	ad2antrr 758	. . . . . 6 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → 𝑊 ∈ LVec)
49	15	ad2antrr 758	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → 𝐺 ∈ 𝐹)
50		simprr 792	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))
51	11, 4, 6, 47, 12, 27	lkrshp 33410	. . . . . . 7 ⊢ ((𝑊 ∈ LVec ∧ 𝐺 ∈ 𝐹 ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)})) → (𝐿‘𝐺) ∈ (LSHyp‘𝑊))
52	48, 49, 50, 51	syl3anc 1318	. . . . . 6 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → (𝐿‘𝐺) ∈ (LSHyp‘𝑊))
53		simplr 788	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → 𝑔 ∈ 𝐹)
54		simprl 790	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → 𝑔 ≠ (𝑉 × {(0g‘𝐷)}))
55	11, 4, 6, 47, 12, 27	lkrshp 33410	. . . . . . 7 ⊢ ((𝑊 ∈ LVec ∧ 𝑔 ∈ 𝐹 ∧ 𝑔 ≠ (𝑉 × {(0g‘𝐷)})) → (𝐿‘𝑔) ∈ (LSHyp‘𝑊))
56	48, 53, 54, 55	syl3anc 1318	. . . . . 6 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → (𝐿‘𝑔) ∈ (LSHyp‘𝑊))
57	47, 48, 52, 56	lshpcmp 33293	. . . . 5 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) ↔ (𝐿‘𝐺) = (𝐿‘𝑔)))
58	1	ad3antrrr 762	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) ∧ (𝐿‘𝐺) = (𝐿‘𝑔)) → 𝑊 ∈ LVec)
59	15	ad3antrrr 762	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) ∧ (𝐿‘𝐺) = (𝐿‘𝑔)) → 𝐺 ∈ 𝐹)
60		simpllr 795	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) ∧ (𝐿‘𝐺) = (𝐿‘𝑔)) → 𝑔 ∈ 𝐹)
61		simpr 476	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) ∧ (𝐿‘𝐺) = (𝐿‘𝑔)) → (𝐿‘𝐺) = (𝐿‘𝑔))
62	4, 5, 13, 11, 12, 27	eqlkr2 33405	. . . . . . 7 ⊢ ((𝑊 ∈ LVec ∧ (𝐺 ∈ 𝐹 ∧ 𝑔 ∈ 𝐹) ∧ (𝐿‘𝐺) = (𝐿‘𝑔)) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})))
63	58, 59, 60, 61, 62	syl121anc 1323	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) ∧ (𝐿‘𝐺) = (𝐿‘𝑔)) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})))
64	63	ex 449	. . . . 5 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → ((𝐿‘𝐺) = (𝐿‘𝑔) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
65	57, 64	sylbid 229	. . . 4 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ (𝑔 ≠ (𝑉 × {(0g‘𝐷)}) ∧ 𝐺 ≠ (𝑉 × {(0g‘𝐷)}))) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
66	25, 46, 65	pm2.61da2ne 2870	. . 3 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) → ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
67	1	ad2antrr 758	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑘 ∈ 𝐾) → 𝑊 ∈ LVec)
68	15	ad2antrr 758	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑘 ∈ 𝐾) → 𝐺 ∈ 𝐹)
69		simpr 476	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑘 ∈ 𝐾) → 𝑘 ∈ 𝐾)
70	11, 4, 5, 13, 12, 27, 67, 68, 69	lkrscss 33403	. . . . . 6 ⊢ (((𝜑 ∧ 𝑔 ∈ 𝐹) ∧ 𝑘 ∈ 𝐾) → (𝐿‘𝐺) ⊆ (𝐿‘(𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
71	70	ex 449	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → (𝑘 ∈ 𝐾 → (𝐿‘𝐺) ⊆ (𝐿‘(𝐺 ∘𝑓 · (𝑉 × {𝑘})))))
72		fveq2 6103	. . . . . . 7 ⊢ (𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})) → (𝐿‘𝑔) = (𝐿‘(𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
73	72	sseq2d 3596	. . . . . 6 ⊢ (𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) ↔ (𝐿‘𝐺) ⊆ (𝐿‘(𝐺 ∘𝑓 · (𝑉 × {𝑘})))))
74	73	biimprcd 239	. . . . 5 ⊢ ((𝐿‘𝐺) ⊆ (𝐿‘(𝐺 ∘𝑓 · (𝑉 × {𝑘}))) → (𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})) → (𝐿‘𝐺) ⊆ (𝐿‘𝑔)))
75	71, 74	syl6 34	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → (𝑘 ∈ 𝐾 → (𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})) → (𝐿‘𝐺) ⊆ (𝐿‘𝑔))))
76	75	rexlimdv 3012	. . 3 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → (∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘})) → (𝐿‘𝐺) ⊆ (𝐿‘𝑔)))
77	66, 76	impbid 201	. 2 ⊢ ((𝜑 ∧ 𝑔 ∈ 𝐹) → ((𝐿‘𝐺) ⊆ (𝐿‘𝑔) ↔ ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))))
78	77	rabbidva 3163	1 ⊢ (𝜑 → {𝑔 ∈ 𝐹 ∣ (𝐿‘𝐺) ⊆ (𝐿‘𝑔)} = {𝑔 ∈ 𝐹 ∣ ∃𝑘 ∈ 𝐾 𝑔 = (𝐺 ∘𝑓 · (𝑉 × {𝑘}))})

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∃wrex 2897  {crab 2900   ⊆ wss 3540  {csn 4125   × cxp 5036  ‘cfv 5804  (class class class)co 6549   ∘_𝑓 cof 6793  Basecbs 15695  ._rcmulr 15769  Scalarcsca 15771  0_gc0g 15923  LModclmod 18686  LVecclvec 18923  LSHypclsh 33280  LFnlclfn 33362  LKerclk 33390

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

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-int 4411  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-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-tpos 7239  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-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-ndx 15698  df-slot 15699  df-base 15700  df-sets 15701  df-ress 15702  df-plusg 15781  df-mulr 15782  df-0g 15925  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-submnd 17159  df-grp 17248  df-minusg 17249  df-sbg 17250  df-subg 17414  df-cntz 17573  df-lsm 17874  df-cmn 18018  df-abl 18019  df-mgp 18313  df-ur 18325  df-ring 18372  df-oppr 18446  df-dvdsr 18464  df-unit 18465  df-invr 18495  df-drng 18572  df-lmod 18688  df-lss 18754  df-lsp 18793  df-lvec 18924  df-lshyp 33282  df-lfl 33363  df-lkr 33391

This theorem is referenced by: (None)