Theorem lindslinindimp2lem2 49664

Description: Lemma 2 for lindslinindsimp2 49668. (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 8872	. . . . . 6 ⊢ (𝑓 ∈ (𝐵 ↑m 𝑆) → 𝑓:𝑆⟶𝐵)
2	1	3ad2ant3 1153	. . . . 5 ⊢ ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆)) → 𝑓:𝑆⟶𝐵)
3	2	adantl 487	. . . 4 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝑓:𝑆⟶𝐵)
4		difss 4072	. . . 4 ⊢ (𝑆 ∖ {𝑥}) ⊆ 𝑆
5		fssres 6748	. . . 4 ⊢ ((𝑓:𝑆⟶𝐵 ∧ (𝑆 ∖ {𝑥}) ⊆ 𝑆) → (𝑓 ↾ (𝑆 ∖ {𝑥})):(𝑆 ∖ {𝑥})⟶𝐵)
6	3, 4, 5	sylancl 598	. . 3 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝑓 ↾ (𝑆 ∖ {𝑥})):(𝑆 ∖ {𝑥})⟶𝐵)
7		lindslinind.g	. . . 4 ⊢ 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥}))
8	7	feq1i 6700	. . 3 ⊢ (𝐺:(𝑆 ∖ {𝑥})⟶𝐵 ↔ (𝑓 ↾ (𝑆 ∖ {𝑥})):(𝑆 ∖ {𝑥})⟶𝐵)
9	6, 8	sylibr 237	. 2 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝐺:(𝑆 ∖ {𝑥})⟶𝐵)
10		lindslinind.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
11	10	fvexi 6899	. . 3 ⊢ 𝐵 ∈ V
12		difexg 5290	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∖ {𝑥}) ∈ V)
13	12	ad2antrr 739	. . 3 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝑆 ∖ {𝑥}) ∈ V)
14		elmapg 8862	. . 3 ⊢ ((𝐵 ∈ V ∧ (𝑆 ∖ {𝑥}) ∈ V) → (𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) ↔ 𝐺:(𝑆 ∖ {𝑥})⟶𝐵))
15	11, 13, 14	sylancr 599	. 2 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) ↔ 𝐺:(𝑆 ∖ {𝑥})⟶𝐵))
16	9, 15	mpbird 260	1 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → 𝐺 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045  {csn 4584   ↾ cres 5652  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ↑_m cmap 8850  Basecbs 17392  Scalarcsca 17436  0_gc0g 17615  inv_gcminusg 19150  LModclmod 21140

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8852

This theorem is used by:  lindslinindimp2lem4  49666  lindslinindsimp2lem5  49667