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 35292
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 7099 . . . . 5 (𝑔 ∈ (𝑇 × 𝐸) → (𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
21adantl 481 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
32rexbidv 3034 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
4 r19.41v 3070 . . . 4 (∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ))
5 fvex 6113 . . . . . . . 8 (1st𝑔) ∈ V
6 eqeq1 2614 . . . . . . . . 9 (𝑓 = (1st𝑔) → (𝑓 = (𝑠𝐹) ↔ (1st𝑔) = (𝑠𝐹)))
76rexbidv 3034 . . . . . . . 8 (𝑓 = (1st𝑔) → (∃𝑠𝐸 𝑓 = (𝑠𝐹) ↔ ∃𝑠𝐸 (1st𝑔) = (𝑠𝐹)))
85, 7elab 3319 . . . . . . 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 35291 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} = {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)})
1514adantr 480 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} = {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)})
1615eleq2d 2673 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st𝑔) ∈ {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} ↔ (1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)}))
178, 16syl5bbr 273 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ↔ (1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)}))
18 xp1st 7089 . . . . . . . 8 (𝑔 ∈ (𝑇 × 𝐸) → (1st𝑔) ∈ 𝑇)
1918adantl 481 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (1st𝑔) ∈ 𝑇)
20 fveq2 6103 . . . . . . . . 9 (𝑓 = (1st𝑔) → (𝑅𝑓) = (𝑅‘(1st𝑔)))
2120breq1d 4593 . . . . . . . 8 (𝑓 = (1st𝑔) → ((𝑅𝑓) (𝑅𝐹) ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2221elrab3 3332 . . . . . . 7 ((1st𝑔) ∈ 𝑇 → ((1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)} ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2319, 22syl 17 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)} ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2417, 23bitrd 267 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2524anbi1d 737 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
264, 25syl5bb 271 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
273, 26bitrd 267 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
2827rabbidva 3163 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  {cab 2596  wrex 2897  {crab 2900  cop 4131   class class class wbr 4583  cmpt 4643   I cid 4948   × cxp 5036  cres 5040  cfv 5804  1st c1st 7057  2nd c2nd 7058  lecple 15775  HLchlt 33655  LHypclh 34288  LTrncltrn 34405  trLctrl 34463  TEndoctendo 35058
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-riotaBAD 33257
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-undef 7286  df-map 7746  df-preset 16751  df-poset 16769  df-plt 16781  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-p0 16862  df-p1 16863  df-lat 16869  df-clat 16931  df-oposet 33481  df-ol 33483  df-oml 33484  df-covers 33571  df-ats 33572  df-atl 33603  df-cvlat 33627  df-hlat 33656  df-llines 33802  df-lplanes 33803  df-lvols 33804  df-lines 33805  df-psubsp 33807  df-pmap 33808  df-padd 34100  df-lhyp 34292  df-laut 34293  df-ldil 34408  df-ltrn 34409  df-trl 34464  df-tendo 35061
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator