Theorem lindslinindimp2lem2 48701

Description: Lemma 2 for lindslinindsimp2 48705. (Contributed by AV, 25-Apr-2019.)

Hypotheses

Ref	Expression
lindslinind.r	⊢ 𝑅 = (Scalar‘𝑀)
lindslinind.b	⊢ 𝐵 = (Base‘𝑅)
lindslinind.0	⊢ 0 = (0g‘𝑅)
lindslinind.z	⊢ 𝑍 = (0g‘𝑀)
lindslinind.y	⊢ 𝑌 = ((invg‘𝑅)‘(𝑓‘𝑥))
lindslinind.g	⊢ 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥}))

Assertion

Ref	Expression
lindslinindimp2lem2	⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})))

Distinct variable groups:   𝐵,𝑓   𝑓,𝑀   𝑅,𝑓,𝑥   𝑆,𝑓,𝑥   𝑓,𝑍   0 ,𝑓,𝑥

Allowed substitution hints:   𝐵(𝑥)   𝐺(𝑥,𝑓)   𝑀(𝑥)   𝑉(𝑥,𝑓)   𝑌(𝑥,𝑓)   𝑍(𝑥)

Proof of Theorem lindslinindimp2lem2

Step	Hyp	Ref	Expression
1		elmapi 8786	. . . . . 6 ⊢ (𝑓 ∈ (𝐵 ↑m 𝑆) → 𝑓:𝑆⟶𝐵)
2	1	3ad2ant3 1135	. . . . 5 ⊢ ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆)) → 𝑓:𝑆⟶𝐵)
3	2	adantl 481	. . . 4 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝑓:𝑆⟶𝐵)
4		difss 4088	. . . 4 ⊢ (𝑆 ∖ {𝑥}) ⊆ 𝑆
5		fssres 6700	. . . 4 ⊢ ((𝑓:𝑆⟶𝐵 ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑆) → (𝑓 ↾ (𝑆 ∖ {𝑥})):(𝑆 ∖ {𝑥})⟶𝐵)
6	3, 4, 5	sylancl 586	. . 3 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝑓 ↾ (𝑆 ∖ {𝑥})):(𝑆 ∖ {𝑥})⟶𝐵)
7		lindslinind.g	. . . 4 ⊢ 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥}))
8	7	feq1i 6653	. . 3 ⊢ (𝐺:(𝑆 ∖ {𝑥})⟶𝐵 ↔ (𝑓 ↾ (𝑆 ∖ {𝑥})):(𝑆 ∖ {𝑥})⟶𝐵)
9	6, 8	sylibr 234	. 2 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝐺:(𝑆 ∖ {𝑥})⟶𝐵)
10		lindslinind.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
11	10	fvexi 6848	. . 3 ⊢ 𝐵 ∈ V
12		difexg 5274	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∖ {𝑥}) ∈ V)
13	12	ad2antrr 726	. . 3 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝑆 ∖ {𝑥}) ∈ V)
14		elmapg 8776	. . 3 ⊢ ((𝐵 ∈ V ∧ (𝑆 ∖ {𝑥}) ∈ V) → (𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) ↔ 𝐺:(𝑆 ∖ {𝑥})⟶𝐵))
15	11, 13, 14	sylancr 587	. 2 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) ↔ 𝐺:(𝑆 ∖ {𝑥})⟶𝐵))
16	9, 15	mpbird 257	1 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  Vcvv 3440   ∖ cdif 3898   ⊆ wss 3901  {csn 4580   ↾ cres 5626  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358   ↑_m cmap 8763  Basecbs 17136  Scalarcsca 17180  0_gc0g 17359  inv_gcminusg 18864  LModclmod 20811

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-map 8765

This theorem is referenced by:  lindslinindimp2lem4  48703  lindslinindsimp2lem5  48704