Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dvhb1dimN Structured version   Visualization version   GIF version

Theorem dvhb1dimN 38927
Description: Two expressions for the 1-dimensional subspaces of vector space H, in the isomorphism B case where the 2nd 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.
StepHypRef Expression
1 eqop 7846 . . . . 5 (𝑔 ∈ (𝑇 × 𝐸) → (𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
21adantl 481 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
32rexbidv 3225 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
4 r19.41v 3273 . . . 4 (∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ))
5 fvex 6769 . . . . . . . 8 (1st𝑔) ∈ V
6 eqeq1 2742 . . . . . . . . 9 (𝑓 = (1st𝑔) → (𝑓 = (𝑠𝐹) ↔ (1st𝑔) = (𝑠𝐹)))
76rexbidv 3225 . . . . . . . 8 (𝑓 = (1st𝑔) → (∃𝑠𝐸 𝑓 = (𝑠𝐹) ↔ ∃𝑠𝐸 (1st𝑔) = (𝑠𝐹)))
85, 7elab 3602 . . . . . . 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‘𝐾)‘𝑊)
149, 10, 11, 12, 13dva1dim 38926 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} = {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)})
1514adantr 480 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} = {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)})
1615eleq2d 2824 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st𝑔) ∈ {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} ↔ (1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)}))
178, 16bitr3id 284 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ↔ (1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)}))
18 xp1st 7836 . . . . . . . 8 (𝑔 ∈ (𝑇 × 𝐸) → (1st𝑔) ∈ 𝑇)
1918adantl 481 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (1st𝑔) ∈ 𝑇)
20 fveq2 6756 . . . . . . . . 9 (𝑓 = (1st𝑔) → (𝑅𝑓) = (𝑅‘(1st𝑔)))
2120breq1d 5080 . . . . . . . 8 (𝑓 = (1st𝑔) → ((𝑅𝑓) (𝑅𝐹) ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2221elrab3 3618 . . . . . . 7 ((1st𝑔) ∈ 𝑇 → ((1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)} ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2319, 22syl 17 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)} ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2417, 23bitrd 278 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2524anbi1d 629 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
264, 25syl5bb 282 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
273, 26bitrd 278 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
2827rabbidva 3402 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  {cab 2715  wrex 3064  {crab 3067  cop 4564   class class class wbr 5070  cmpt 5153   I cid 5479   × cxp 5578  cres 5582  cfv 6418  1st c1st 7802  2nd c2nd 7803  lecple 16895  HLchlt 37291  LHypclh 37925  LTrncltrn 38042  trLctrl 38099  TEndoctendo 38693
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-riotaBAD 36894
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-undef 8060  df-map 8575  df-proset 17928  df-poset 17946  df-plt 17963  df-lub 17979  df-glb 17980  df-join 17981  df-meet 17982  df-p0 18058  df-p1 18059  df-lat 18065  df-clat 18132  df-oposet 37117  df-ol 37119  df-oml 37120  df-covers 37207  df-ats 37208  df-atl 37239  df-cvlat 37263  df-hlat 37292  df-llines 37439  df-lplanes 37440  df-lvols 37441  df-lines 37442  df-psubsp 37444  df-pmap 37445  df-padd 37737  df-lhyp 37929  df-laut 37930  df-ldil 38045  df-ltrn 38046  df-trl 38100  df-tendo 38696
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator