MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lbspropd Structured version   Visualization version   GIF version

Theorem lbspropd 19147
Description: If two structures have the same components (properties), they have the same set of bases. (Contributed by Mario Carneiro, 9-Feb-2015.) (Revised by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
lbspropd.b1 (𝜑𝐵 = (Base‘𝐾))
lbspropd.b2 (𝜑𝐵 = (Base‘𝐿))
lbspropd.w (𝜑𝐵𝑊)
lbspropd.p ((𝜑 ∧ (𝑥𝑊𝑦𝑊)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
lbspropd.s1 ((𝜑 ∧ (𝑥𝑃𝑦𝐵)) → (𝑥( ·𝑠𝐾)𝑦) ∈ 𝑊)
lbspropd.s2 ((𝜑 ∧ (𝑥𝑃𝑦𝐵)) → (𝑥( ·𝑠𝐾)𝑦) = (𝑥( ·𝑠𝐿)𝑦))
lbspropd.f 𝐹 = (Scalar‘𝐾)
lbspropd.g 𝐺 = (Scalar‘𝐿)
lbspropd.p1 (𝜑𝑃 = (Base‘𝐹))
lbspropd.p2 (𝜑𝑃 = (Base‘𝐺))
lbspropd.a ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥(+g𝐹)𝑦) = (𝑥(+g𝐺)𝑦))
lbspropd.v1 (𝜑𝐾 ∈ V)
lbspropd.v2 (𝜑𝐿 ∈ V)
Assertion
Ref Expression
lbspropd (𝜑 → (LBasis‘𝐾) = (LBasis‘𝐿))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝑃,𝑦   𝑥,𝑊,𝑦

Proof of Theorem lbspropd
Dummy variables 𝑣 𝑢 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simplll 813 . . . . . . . . . . . . 13 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → 𝜑)
2 eldifi 3765 . . . . . . . . . . . . . 14 (𝑣 ∈ (𝑃 ∖ {(0g𝐹)}) → 𝑣𝑃)
32adantl 481 . . . . . . . . . . . . 13 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → 𝑣𝑃)
4 simpr 476 . . . . . . . . . . . . . . 15 ((𝜑𝑧𝐵) → 𝑧𝐵)
54sselda 3636 . . . . . . . . . . . . . 14 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → 𝑢𝐵)
65adantr 480 . . . . . . . . . . . . 13 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → 𝑢𝐵)
7 lbspropd.s2 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑥𝑃𝑦𝐵)) → (𝑥( ·𝑠𝐾)𝑦) = (𝑥( ·𝑠𝐿)𝑦))
87oveqrspc2v 6713 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑣𝑃𝑢𝐵)) → (𝑣( ·𝑠𝐾)𝑢) = (𝑣( ·𝑠𝐿)𝑢))
91, 3, 6, 8syl12anc 1364 . . . . . . . . . . . 12 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → (𝑣( ·𝑠𝐾)𝑢) = (𝑣( ·𝑠𝐿)𝑢))
10 lbspropd.b1 . . . . . . . . . . . . . . 15 (𝜑𝐵 = (Base‘𝐾))
11 lbspropd.b2 . . . . . . . . . . . . . . 15 (𝜑𝐵 = (Base‘𝐿))
12 lbspropd.w . . . . . . . . . . . . . . 15 (𝜑𝐵𝑊)
13 lbspropd.p . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑥𝑊𝑦𝑊)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
14 lbspropd.s1 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑥𝑃𝑦𝐵)) → (𝑥( ·𝑠𝐾)𝑦) ∈ 𝑊)
15 lbspropd.p1 . . . . . . . . . . . . . . . 16 (𝜑𝑃 = (Base‘𝐹))
16 lbspropd.f . . . . . . . . . . . . . . . . 17 𝐹 = (Scalar‘𝐾)
1716fveq2i 6232 . . . . . . . . . . . . . . . 16 (Base‘𝐹) = (Base‘(Scalar‘𝐾))
1815, 17syl6eq 2701 . . . . . . . . . . . . . . 15 (𝜑𝑃 = (Base‘(Scalar‘𝐾)))
19 lbspropd.p2 . . . . . . . . . . . . . . . 16 (𝜑𝑃 = (Base‘𝐺))
20 lbspropd.g . . . . . . . . . . . . . . . . 17 𝐺 = (Scalar‘𝐿)
2120fveq2i 6232 . . . . . . . . . . . . . . . 16 (Base‘𝐺) = (Base‘(Scalar‘𝐿))
2219, 21syl6eq 2701 . . . . . . . . . . . . . . 15 (𝜑𝑃 = (Base‘(Scalar‘𝐿)))
23 lbspropd.v1 . . . . . . . . . . . . . . 15 (𝜑𝐾 ∈ V)
24 lbspropd.v2 . . . . . . . . . . . . . . 15 (𝜑𝐿 ∈ V)
2510, 11, 12, 13, 14, 7, 18, 22, 23, 24lsppropd 19066 . . . . . . . . . . . . . 14 (𝜑 → (LSpan‘𝐾) = (LSpan‘𝐿))
261, 25syl 17 . . . . . . . . . . . . 13 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → (LSpan‘𝐾) = (LSpan‘𝐿))
2726fveq1d 6231 . . . . . . . . . . . 12 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) = ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))
289, 27eleq12d 2724 . . . . . . . . . . 11 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → ((𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) ↔ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))
2928notbid 307 . . . . . . . . . 10 ((((𝜑𝑧𝐵) ∧ 𝑢𝑧) ∧ 𝑣 ∈ (𝑃 ∖ {(0g𝐹)})) → (¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) ↔ ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))
3029ralbidva 3014 . . . . . . . . 9 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (∀𝑣 ∈ (𝑃 ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) ↔ ∀𝑣 ∈ (𝑃 ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))
3115ad2antrr 762 . . . . . . . . . . 11 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → 𝑃 = (Base‘𝐹))
3231difeq1d 3760 . . . . . . . . . 10 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (𝑃 ∖ {(0g𝐹)}) = ((Base‘𝐹) ∖ {(0g𝐹)}))
3332raleqdv 3174 . . . . . . . . 9 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (∀𝑣 ∈ (𝑃 ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) ↔ ∀𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢}))))
3419ad2antrr 762 . . . . . . . . . . 11 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → 𝑃 = (Base‘𝐺))
35 lbspropd.a . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑥𝑃𝑦𝑃)) → (𝑥(+g𝐹)𝑦) = (𝑥(+g𝐺)𝑦))
3615, 19, 35grpidpropd 17308 . . . . . . . . . . . . 13 (𝜑 → (0g𝐹) = (0g𝐺))
3736ad2antrr 762 . . . . . . . . . . . 12 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (0g𝐹) = (0g𝐺))
3837sneqd 4222 . . . . . . . . . . 11 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → {(0g𝐹)} = {(0g𝐺)})
3934, 38difeq12d 3762 . . . . . . . . . 10 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (𝑃 ∖ {(0g𝐹)}) = ((Base‘𝐺) ∖ {(0g𝐺)}))
4039raleqdv 3174 . . . . . . . . 9 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (∀𝑣 ∈ (𝑃 ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})) ↔ ∀𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))
4130, 33, 403bitr3d 298 . . . . . . . 8 (((𝜑𝑧𝐵) ∧ 𝑢𝑧) → (∀𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) ↔ ∀𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))
4241ralbidva 3014 . . . . . . 7 ((𝜑𝑧𝐵) → (∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})) ↔ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))
4342anbi2d 740 . . . . . 6 ((𝜑𝑧𝐵) → ((((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢}))) ↔ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))))
4443pm5.32da 674 . . . . 5 (𝜑 → ((𝑧𝐵 ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})))) ↔ (𝑧𝐵 ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))))
4510sseq2d 3666 . . . . . 6 (𝜑 → (𝑧𝐵𝑧 ⊆ (Base‘𝐾)))
4645anbi1d 741 . . . . 5 (𝜑 → ((𝑧𝐵 ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})))) ↔ (𝑧 ⊆ (Base‘𝐾) ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢}))))))
4711sseq2d 3666 . . . . . 6 (𝜑 → (𝑧𝐵𝑧 ⊆ (Base‘𝐿)))
4825fveq1d 6231 . . . . . . . 8 (𝜑 → ((LSpan‘𝐾)‘𝑧) = ((LSpan‘𝐿)‘𝑧))
4910, 11eqtr3d 2687 . . . . . . . 8 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
5048, 49eqeq12d 2666 . . . . . . 7 (𝜑 → (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ↔ ((LSpan‘𝐿)‘𝑧) = (Base‘𝐿)))
5150anbi1d 741 . . . . . 6 (𝜑 → ((((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))) ↔ (((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))))
5247, 51anbi12d 747 . . . . 5 (𝜑 → ((𝑧𝐵 ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))) ↔ (𝑧 ⊆ (Base‘𝐿) ∧ (((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))))
5344, 46, 523bitr3d 298 . . . 4 (𝜑 → ((𝑧 ⊆ (Base‘𝐾) ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})))) ↔ (𝑧 ⊆ (Base‘𝐿) ∧ (((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))))))
54 3anass 1059 . . . 4 ((𝑧 ⊆ (Base‘𝐾) ∧ ((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢}))) ↔ (𝑧 ⊆ (Base‘𝐾) ∧ (((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})))))
55 3anass 1059 . . . 4 ((𝑧 ⊆ (Base‘𝐿) ∧ ((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢}))) ↔ (𝑧 ⊆ (Base‘𝐿) ∧ (((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))))
5653, 54, 553bitr4g 303 . . 3 (𝜑 → ((𝑧 ⊆ (Base‘𝐾) ∧ ((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢}))) ↔ (𝑧 ⊆ (Base‘𝐿) ∧ ((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))))
57 eqid 2651 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
58 eqid 2651 . . . . 5 ( ·𝑠𝐾) = ( ·𝑠𝐾)
59 eqid 2651 . . . . 5 (Base‘𝐹) = (Base‘𝐹)
60 eqid 2651 . . . . 5 (LBasis‘𝐾) = (LBasis‘𝐾)
61 eqid 2651 . . . . 5 (LSpan‘𝐾) = (LSpan‘𝐾)
62 eqid 2651 . . . . 5 (0g𝐹) = (0g𝐹)
6357, 16, 58, 59, 60, 61, 62islbs 19124 . . . 4 (𝐾 ∈ V → (𝑧 ∈ (LBasis‘𝐾) ↔ (𝑧 ⊆ (Base‘𝐾) ∧ ((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})))))
6423, 63syl 17 . . 3 (𝜑 → (𝑧 ∈ (LBasis‘𝐾) ↔ (𝑧 ⊆ (Base‘𝐾) ∧ ((LSpan‘𝐾)‘𝑧) = (Base‘𝐾) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐹) ∖ {(0g𝐹)}) ¬ (𝑣( ·𝑠𝐾)𝑢) ∈ ((LSpan‘𝐾)‘(𝑧 ∖ {𝑢})))))
65 eqid 2651 . . . . 5 (Base‘𝐿) = (Base‘𝐿)
66 eqid 2651 . . . . 5 ( ·𝑠𝐿) = ( ·𝑠𝐿)
67 eqid 2651 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
68 eqid 2651 . . . . 5 (LBasis‘𝐿) = (LBasis‘𝐿)
69 eqid 2651 . . . . 5 (LSpan‘𝐿) = (LSpan‘𝐿)
70 eqid 2651 . . . . 5 (0g𝐺) = (0g𝐺)
7165, 20, 66, 67, 68, 69, 70islbs 19124 . . . 4 (𝐿 ∈ V → (𝑧 ∈ (LBasis‘𝐿) ↔ (𝑧 ⊆ (Base‘𝐿) ∧ ((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))))
7224, 71syl 17 . . 3 (𝜑 → (𝑧 ∈ (LBasis‘𝐿) ↔ (𝑧 ⊆ (Base‘𝐿) ∧ ((LSpan‘𝐿)‘𝑧) = (Base‘𝐿) ∧ ∀𝑢𝑧𝑣 ∈ ((Base‘𝐺) ∖ {(0g𝐺)}) ¬ (𝑣( ·𝑠𝐿)𝑢) ∈ ((LSpan‘𝐿)‘(𝑧 ∖ {𝑢})))))
7356, 64, 723bitr4d 300 . 2 (𝜑 → (𝑧 ∈ (LBasis‘𝐾) ↔ 𝑧 ∈ (LBasis‘𝐿)))
7473eqrdv 2649 1 (𝜑 → (LBasis‘𝐾) = (LBasis‘𝐿))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383  w3a 1054   = wceq 1523  wcel 2030  wral 2941  Vcvv 3231  cdif 3604  wss 3607  {csn 4210  cfv 5926  (class class class)co 6690  Basecbs 15904  +gcplusg 15988  Scalarcsca 15991   ·𝑠 cvsca 15992  0gc0g 16147  LSpanclspn 19019  LBasisclbs 19122
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-ov 6693  df-0g 16149  df-lss 18981  df-lsp 19020  df-lbs 19123
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator