Theorem dvhb1dimN 41788

Description: Two expressions for the 1-dimensional subspaces of vector space 𝐻, in the isomorphism B case where the second vector component is zero. (Contributed by NM, 23-Feb-2014.) (New usage is discouraged.)

Hypotheses

Ref	Expression
dvhb1dim.l	⊢ ≤ = (le‘𝐾)
dvhb1dim.h	⊢ 𝐻 = (LHyp‘𝐾)
dvhb1dim.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dvhb1dim.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
dvhb1dim.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
dvhb1dim.o	⊢ 0 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))

Assertion

Ref	Expression
dvhb1dimN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠 ∈ 𝐸 𝑔 = ⟨(𝑠‘𝐹), 0 ⟩} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )})

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

Allowed substitution hints:   𝐵(𝑔, ℎ, 𝑠)   𝑅(𝑔, ℎ)   𝐸(𝑔, ℎ)   𝐹(ℎ)   𝐻(ℎ)   𝐾(ℎ)   ≤ (𝑔, ℎ)   𝑊(ℎ)   0 (𝑔, ℎ)

Proof of Theorem dvhb1dimN

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqop 8026	. . . . 5 ⊢ (𝑔 ∈ (𝑇 × 𝐸) → (𝑔 = ⟨(𝑠‘𝐹), 0 ⟩ ↔ ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
2	1	adantl 486	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (𝑔 = ⟨(𝑠‘𝐹), 0 ⟩ ↔ ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
3	2	rexbidv 3188	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 𝑔 = ⟨(𝑠‘𝐹), 0 ⟩ ↔ ∃𝑠 ∈ 𝐸 ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
4		r19.41v 3194	. . . 4 ⊢ (∃𝑠 ∈ 𝐸 ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 ) ↔ (∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 ))
5		fvex 6894	. . . . . . . 8 ⊢ (1st ‘𝑔) ∈ V
6		eqeq1 2766	. . . . . . . . 9 ⊢ (𝑓 = (1st ‘𝑔) → (𝑓 = (𝑠‘𝐹) ↔ (1st ‘𝑔) = (𝑠‘𝐹)))
7	6	rexbidv 3188	. . . . . . . 8 ⊢ (𝑓 = (1st ‘𝑔) → (∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹) ↔ ∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹)))
8	5, 7	elab 3637	. . . . . . 7 ⊢ ((1st ‘𝑔) ∈ {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} ↔ ∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹))
9		dvhb1dim.l	. . . . . . . . . 10 ⊢ ≤ = (le‘𝐾)
10		dvhb1dim.h	. . . . . . . . . 10 ⊢ 𝐻 = (LHyp‘𝐾)
11		dvhb1dim.t	. . . . . . . . . 10 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
12		dvhb1dim.r	. . . . . . . . . 10 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
13		dvhb1dim.e	. . . . . . . . . 10 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
14	9, 10, 11, 12, 13	dva1dim 41787	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} = {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)})
15	14	adantr 485	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} = {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)})
16	15	eleq2d 2848	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st ‘𝑔) ∈ {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} ↔ (1st ‘𝑔) ∈ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)}))
17	8, 16	bitr3id 288	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹) ↔ (1st ‘𝑔) ∈ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)}))
18		xp1st 8016	. . . . . . . 8 ⊢ (𝑔 ∈ (𝑇 × 𝐸) → (1st ‘𝑔) ∈ 𝑇)
19	18	adantl 486	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (1st ‘𝑔) ∈ 𝑇)
20		fveq2 6881	. . . . . . . . 9 ⊢ (𝑓 = (1st ‘𝑔) → (𝑅‘𝑓) = (𝑅‘(1st ‘𝑔)))
21	20	breq1d 5118	. . . . . . . 8 ⊢ (𝑓 = (1st ‘𝑔) → ((𝑅‘𝑓) ≤ (𝑅‘𝐹) ↔ (𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹)))
22	21	elrab3 3650	. . . . . . 7 ⊢ ((1st ‘𝑔) ∈ 𝑇 → ((1st ‘𝑔) ∈ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)} ↔ (𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹)))
23	19, 22	syl 18	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st ‘𝑔) ∈ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)} ↔ (𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹)))
24	17, 23	bitrd 282	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹) ↔ (𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹)))
25	24	anbi1d 642	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 ) ↔ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
26	4, 25	bitrid 286	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 ) ↔ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
27	3, 26	bitrd 282	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 𝑔 = ⟨(𝑠‘𝐹), 0 ⟩ ↔ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
28	27	rabbidva 3421	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠 ∈ 𝐸 𝑔 = ⟨(𝑠‘𝐹), 0 ⟩} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  {cab 2740  ∃wrex 3088  {crab 3415  ⟨cop 4594   class class class wbr 5108   ↦ cmpt 5191   I cid 5554   × cxp 5658   ↾ cres 5662  ‘cfv 6536  1^st c1st 7982  2^nd c2nd 7983  lecple 17323  HLchlt 40152  LHypclh 40786  LTrncltrn 40903  trLctrl 40960  TEndoctendo 41554

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-riotaBAD 39755

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-undef 8267  df-map 8824  df-proset 18356  df-poset 18375  df-plt 18390  df-lub 18406  df-glb 18407  df-join 18408  df-meet 18409  df-p0 18485  df-p1 18486  df-lat 18494  df-clat 18561  df-oposet 39978  df-ol 39980  df-oml 39981  df-covers 40068  df-ats 40069  df-atl 40100  df-cvlat 40124  df-hlat 40153  df-llines 40300  df-lplanes 40301  df-lvols 40302  df-lines 40303  df-psubsp 40305  df-pmap 40306  df-padd 40598  df-lhyp 40790  df-laut 40791  df-ldil 40906  df-ltrn 40907  df-trl 40961  df-tendo 41557

This theorem is used by: (None)