Theorem dvhb1dimN 41963

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 487	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (𝑔 = ⟨(𝑠‘𝐹), 0 ⟩ ↔ ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
3	2	rexbidv 3186	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 𝑔 = ⟨(𝑠‘𝐹), 0 ⟩ ↔ ∃𝑠 ∈ 𝐸 ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 )))
4		r19.41v 3192	. . . 4 ⊢ (∃𝑠 ∈ 𝐸 ((1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 ) ↔ (∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹) ∧ (2nd ‘𝑔) = 0 ))
5		fvex 6886	. . . . . . . 8 ⊢ (1st ‘𝑔) ∈ V
6		eqeq1 2764	. . . . . . . . 9 ⊢ (𝑓 = (1st ‘𝑔) → (𝑓 = (𝑠‘𝐹) ↔ (1st ‘𝑔) = (𝑠‘𝐹)))
7	6	rexbidv 3186	. . . . . . . 8 ⊢ (𝑓 = (1st ‘𝑔) → (∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹) ↔ ∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹)))
8	5, 7	elab 3632	. . . . . . 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 41962	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} = {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)})
15	14	adantr 486	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} = {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)})
16	15	eleq2d 2846	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st ‘𝑔) ∈ {𝑓 ∣ ∃𝑠 ∈ 𝐸 𝑓 = (𝑠‘𝐹)} ↔ (1st ‘𝑔) ∈ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)}))
17	8, 16	bitr3id 288	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠 ∈ 𝐸 (1st ‘𝑔) = (𝑠‘𝐹) ↔ (1st ‘𝑔) ∈ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ (𝑅‘𝐹)}))
18		xp1st 8016	. . . . . . . 8 ⊢ (𝑔 ∈ (𝑇 × 𝐸) → (1st ‘𝑔) ∈ 𝑇)
19	18	adantl 487	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (1st ‘𝑔) ∈ 𝑇)
20		fveq2 6873	. . . . . . . . 9 ⊢ (𝑓 = (1st ‘𝑔) → (𝑅‘𝑓) = (𝑅‘(1st ‘𝑔)))
21	20	breq1d 5112	. . . . . . . 8 ⊢ (𝑓 = (1st ‘𝑔) → ((𝑅‘𝑓) ≤ (𝑅‘𝐹) ↔ (𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹)))
22	21	elrab3 3645	. . . . . . 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 643	. . . 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 3418	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠 ∈ 𝐸 𝑔 = ⟨(𝑠‘𝐹), 0 ⟩} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  ∃wrex 3086  {crab 3412  ⟨cop 4589   class class class wbr 5102   ↦ cmpt 5185   I cid 5541   × cxp 5645   ↾ cres 5649  ‘cfv 6527  1^st c1st 7982  2^nd c2nd 7983  lecple 17396  HLchlt 40327  LHypclh 40961  LTrncltrn 41078  trLctrl 41135  TEndoctendo 41729

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-riotaBAD 39930

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-undef 8268  df-map 8827  df-proset 18429  df-poset 18448  df-plt 18463  df-lub 18479  df-glb 18480  df-join 18481  df-meet 18482  df-p0 18558  df-p1 18559  df-lat 18567  df-clat 18634  df-oposet 40153  df-ol 40155  df-oml 40156  df-covers 40243  df-ats 40244  df-atl 40275  df-cvlat 40299  df-hlat 40328  df-llines 40475  df-lplanes 40476  df-lvols 40477  df-lines 40478  df-psubsp 40480  df-pmap 40481  df-padd 40773  df-lhyp 40965  df-laut 40966  df-ldil 41081  df-ltrn 41082  df-trl 41136  df-tendo 41732

This theorem is used by: (None)