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 40973
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.
StepHypRef Expression
1 eqop 7989 . . . . 5 (𝑔 ∈ (𝑇 × 𝐸) → (𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
21adantl 481 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
32rexbidv 3157 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 )))
4 r19.41v 3165 . . . 4 (∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ))
5 fvex 6853 . . . . . . . 8 (1st𝑔) ∈ V
6 eqeq1 2733 . . . . . . . . 9 (𝑓 = (1st𝑔) → (𝑓 = (𝑠𝐹) ↔ (1st𝑔) = (𝑠𝐹)))
76rexbidv 3157 . . . . . . . 8 (𝑓 = (1st𝑔) → (∃𝑠𝐸 𝑓 = (𝑠𝐹) ↔ ∃𝑠𝐸 (1st𝑔) = (𝑠𝐹)))
85, 7elab 3643 . . . . . . 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 40972 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} = {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)})
1514adantr 480 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} = {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)})
1615eleq2d 2814 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st𝑔) ∈ {𝑓 ∣ ∃𝑠𝐸 𝑓 = (𝑠𝐹)} ↔ (1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)}))
178, 16bitr3id 285 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ↔ (1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)}))
18 xp1st 7979 . . . . . . . 8 (𝑔 ∈ (𝑇 × 𝐸) → (1st𝑔) ∈ 𝑇)
1918adantl 481 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (1st𝑔) ∈ 𝑇)
20 fveq2 6840 . . . . . . . . 9 (𝑓 = (1st𝑔) → (𝑅𝑓) = (𝑅‘(1st𝑔)))
2120breq1d 5112 . . . . . . . 8 (𝑓 = (1st𝑔) → ((𝑅𝑓) (𝑅𝐹) ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2221elrab3 3657 . . . . . . 7 ((1st𝑔) ∈ 𝑇 → ((1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)} ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2319, 22syl 17 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((1st𝑔) ∈ {𝑓𝑇 ∣ (𝑅𝑓) (𝑅𝐹)} ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2417, 23bitrd 279 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ↔ (𝑅‘(1st𝑔)) (𝑅𝐹)))
2524anbi1d 631 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → ((∃𝑠𝐸 (1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
264, 25bitrid 283 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 ((1st𝑔) = (𝑠𝐹) ∧ (2nd𝑔) = 0 ) ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
273, 26bitrd 279 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ 𝑔 ∈ (𝑇 × 𝐸)) → (∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩ ↔ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )))
2827rabbidva 3409 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠𝐸 𝑔 = ⟨(𝑠𝐹), 0 ⟩} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st𝑔)) (𝑅𝐹) ∧ (2nd𝑔) = 0 )})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  {cab 2707  wrex 3053  {crab 3402  cop 4591   class class class wbr 5102  cmpt 5183   I cid 5525   × cxp 5629  cres 5633  cfv 6499  1st c1st 7945  2nd c2nd 7946  lecple 17203  HLchlt 39336  LHypclh 39971  LTrncltrn 40088  trLctrl 40145  TEndoctendo 40739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-riotaBAD 38939
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-1st 7947  df-2nd 7948  df-undef 8229  df-map 8778  df-proset 18235  df-poset 18254  df-plt 18269  df-lub 18285  df-glb 18286  df-join 18287  df-meet 18288  df-p0 18364  df-p1 18365  df-lat 18373  df-clat 18440  df-oposet 39162  df-ol 39164  df-oml 39165  df-covers 39252  df-ats 39253  df-atl 39284  df-cvlat 39308  df-hlat 39337  df-llines 39485  df-lplanes 39486  df-lvols 39487  df-lines 39488  df-psubsp 39490  df-pmap 39491  df-padd 39783  df-lhyp 39975  df-laut 39976  df-ldil 40091  df-ltrn 40092  df-trl 40146  df-tendo 40742
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator