Theorem dva1dim 41621

Description: Two expressions for the 1-dimensional subspaces of partial vector space A. Remark in [Crawley] p. 120 line 21, but using a non-identity translation (nonzero vector) 𝐹 whose trace is 𝑃 rather than 𝑃 itself; 𝐹 exists by cdlemf 41199. 𝐸 is the division ring base by erngdv 41629, and 𝑠‘𝐹 is the scalar product by dvavsca 41653. 𝐹 must be a non-identity translation for the expression to be a 1-dimensional subspace, although the theorem doesn't require it. (Contributed by NM, 14-Oct-2013.)

Hypotheses

Ref	Expression
dva1dim.l	⊢ ≤ = (le‘𝐾)
dva1dim.h	⊢ 𝐻 = (LHyp‘𝐾)
dva1dim.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dva1dim.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
dva1dim.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)

Assertion

Ref	Expression
dva1dim	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∣ ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹)} = {𝑔 ∈ 𝑇 ∣ (𝑅‘𝑔) ≤ (𝑅‘𝐹)})

Distinct variable groups:   ≤ ,𝑠   𝐸,𝑠   𝑔,𝑠,𝐹   𝑔,𝐻,𝑠   𝑔,𝐾,𝑠   𝑅,𝑠   𝑇,𝑔,𝑠   𝑔,𝑊,𝑠

Allowed substitution hints:   𝑅(𝑔)   𝐸(𝑔)   ≤ (𝑔)

Proof of Theorem dva1dim

Step	Hyp	Ref	Expression
1		dva1dim.h	. . . . . . . . . 10 ⊢ 𝐻 = (LHyp‘𝐾)
2		dva1dim.t	. . . . . . . . . 10 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
3		dva1dim.e	. . . . . . . . . 10 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
4	1, 2, 3	tendocl 41403	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑠‘𝐹) ∈ 𝑇)
5		dva1dim.l	. . . . . . . . . 10 ⊢ ≤ = (le‘𝐾)
6		dva1dim.r	. . . . . . . . . 10 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
7	5, 1, 2, 6, 3	tendotp 41397	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑅‘(𝑠‘𝐹)) ≤ (𝑅‘𝐹))
8	4, 7	jca 520	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → ((𝑠‘𝐹) ∈ 𝑇 ∧ (𝑅‘(𝑠‘𝐹)) ≤ (𝑅‘𝐹)))
9	8	3expb 1136	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑠 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇)) → ((𝑠‘𝐹) ∈ 𝑇 ∧ (𝑅‘(𝑠‘𝐹)) ≤ (𝑅‘𝐹)))
10	9	anass1rs 667	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑠 ∈ 𝐸) → ((𝑠‘𝐹) ∈ 𝑇 ∧ (𝑅‘(𝑠‘𝐹)) ≤ (𝑅‘𝐹)))
11		eleq1 2853	. . . . . . 7 ⊢ (𝑔 = (𝑠‘𝐹) → (𝑔 ∈ 𝑇 ↔ (𝑠‘𝐹) ∈ 𝑇))
12		fveq2 6871	. . . . . . . 8 ⊢ (𝑔 = (𝑠‘𝐹) → (𝑅‘𝑔) = (𝑅‘(𝑠‘𝐹)))
13	12	breq1d 5115	. . . . . . 7 ⊢ (𝑔 = (𝑠‘𝐹) → ((𝑅‘𝑔) ≤ (𝑅‘𝐹) ↔ (𝑅‘(𝑠‘𝐹)) ≤ (𝑅‘𝐹)))
14	11, 13	anbi12d 643	. . . . . 6 ⊢ (𝑔 = (𝑠‘𝐹) → ((𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹)) ↔ ((𝑠‘𝐹) ∈ 𝑇 ∧ (𝑅‘(𝑠‘𝐹)) ≤ (𝑅‘𝐹))))
15	10, 14	syl5ibrcom 250	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑠 ∈ 𝐸) → (𝑔 = (𝑠‘𝐹) → (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))))
16	15	rexlimdva 3166	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹) → (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))))
17		simpll 778	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
18		simplr 780	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))) → 𝐹 ∈ 𝑇)
19		simprl 782	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))) → 𝑔 ∈ 𝑇)
20		simprr 784	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))) → (𝑅‘𝑔) ≤ (𝑅‘𝐹))
21	5, 1, 2, 6, 3	tendoex 41611	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹)) → ∃𝑠 ∈ 𝐸 (𝑠‘𝐹) = 𝑔)
22	17, 18, 19, 20, 21	syl121anc 1398	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))) → ∃𝑠 ∈ 𝐸 (𝑠‘𝐹) = 𝑔)
23		eqcom 2772	. . . . . . 7 ⊢ ((𝑠‘𝐹) = 𝑔 ↔ 𝑔 = (𝑠‘𝐹))
24	23	rexbii 3112	. . . . . 6 ⊢ (∃𝑠 ∈ 𝐸 (𝑠‘𝐹) = 𝑔 ↔ ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹))
25	22, 24	sylib 221	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))) → ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹))
26	25	ex 417	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ((𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹)) → ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹)))
27	16, 26	impbid 215	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹) ↔ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))))
28	27	abbidv 2831	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∣ ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹)} = {𝑔 ∣ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))})
29		df-rab 3418	. 2 ⊢ {𝑔 ∈ 𝑇 ∣ (𝑅‘𝑔) ≤ (𝑅‘𝐹)} = {𝑔 ∣ (𝑔 ∈ 𝑇 ∧ (𝑅‘𝑔) ≤ (𝑅‘𝐹))}
30	28, 29	eqtr4di 2818	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∣ ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹)} = {𝑔 ∈ 𝑇 ∣ (𝑅‘𝑔) ≤ (𝑅‘𝐹)})

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  {cab 2743  ∃wrex 3089  {crab 3417   class class class wbr 5105  ‘cfv 6525  lecple 17307  HLchlt 39986  LHypclh 40620  LTrncltrn 40737  trLctrl 40794  TEndoctendo 41388

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-riotaBAD 39589

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-iin 4955  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-undef 8257  df-map 8814  df-proset 18340  df-poset 18359  df-plt 18374  df-lub 18390  df-glb 18391  df-join 18392  df-meet 18393  df-p0 18469  df-p1 18470  df-lat 18478  df-clat 18545  df-oposet 39812  df-ol 39814  df-oml 39815  df-covers 39902  df-ats 39903  df-atl 39934  df-cvlat 39958  df-hlat 39987  df-llines 40134  df-lplanes 40135  df-lvols 40136  df-lines 40137  df-psubsp 40139  df-pmap 40140  df-padd 40432  df-lhyp 40624  df-laut 40625  df-ldil 40740  df-ltrn 40741  df-trl 40795  df-tendo 41391

This theorem is referenced by:  dvhb1dimN  41622  dia1dim  41697