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

Theorem lpolsatN 41980
Description: The polarity of an atomic subspace is a hyperplane. (Contributed by NM, 26-Nov-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
lpolsat.a 𝐴 = (LSAtoms‘𝑊)
lpolsat.h 𝐻 = (LSHyp‘𝑊)
lpolsat.p 𝑃 = (LPol‘𝑊)
lpolsat.w (𝜑𝑊𝑋)
lpolsat.o (𝜑𝑃)
lpolsat.q (𝜑𝑄𝐴)
Assertion
Ref Expression
lpolsatN (𝜑 → ( 𝑄) ∈ 𝐻)

Proof of Theorem lpolsatN
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lpolsat.o . . 3 (𝜑𝑃)
2 lpolsat.w . . . 4 (𝜑𝑊𝑋)
3 eqid 2739 . . . . 5 (Base‘𝑊) = (Base‘𝑊)
4 eqid 2739 . . . . 5 (LSubSp‘𝑊) = (LSubSp‘𝑊)
5 eqid 2739 . . . . 5 (0g𝑊) = (0g𝑊)
6 lpolsat.a . . . . 5 𝐴 = (LSAtoms‘𝑊)
7 lpolsat.h . . . . 5 𝐻 = (LSHyp‘𝑊)
8 lpolsat.p . . . . 5 𝑃 = (LPol‘𝑊)
93, 4, 5, 6, 7, 8islpolN 41975 . . . 4 (𝑊𝑋 → ( 𝑃 ↔ ( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥)))))
102, 9syl 17 . . 3 (𝜑 → ( 𝑃 ↔ ( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥)))))
111, 10mpbid 233 . 2 (𝜑 → ( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))))
12 simpr3 1203 . . 3 (( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))) → ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))
13 lpolsat.q . . . 4 (𝜑𝑄𝐴)
14 fveq2 6827 . . . . . . 7 (𝑥 = 𝑄 → ( 𝑥) = ( 𝑄))
1514eleq1d 2824 . . . . . 6 (𝑥 = 𝑄 → (( 𝑥) ∈ 𝐻 ↔ ( 𝑄) ∈ 𝐻))
16 2fveq3 6832 . . . . . . 7 (𝑥 = 𝑄 → ( ‘( 𝑥)) = ( ‘( 𝑄)))
17 id 22 . . . . . . 7 (𝑥 = 𝑄𝑥 = 𝑄)
1816, 17eqeq12d 2755 . . . . . 6 (𝑥 = 𝑄 → (( ‘( 𝑥)) = 𝑥 ↔ ( ‘( 𝑄)) = 𝑄))
1915, 18anbi12d 638 . . . . 5 (𝑥 = 𝑄 → ((( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥) ↔ (( 𝑄) ∈ 𝐻 ∧ ( ‘( 𝑄)) = 𝑄)))
2019rspcv 3556 . . . 4 (𝑄𝐴 → (∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥) → (( 𝑄) ∈ 𝐻 ∧ ( ‘( 𝑄)) = 𝑄)))
2113, 20syl 17 . . 3 (𝜑 → (∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥) → (( 𝑄) ∈ 𝐻 ∧ ( ‘( 𝑄)) = 𝑄)))
22 simpl 483 . . 3 ((( 𝑄) ∈ 𝐻 ∧ ( ‘( 𝑄)) = 𝑄) → ( 𝑄) ∈ 𝐻)
2312, 21, 22syl56 36 . 2 (𝜑 → (( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))) → ( 𝑄) ∈ 𝐻))
2411, 23mpd 15 1 (𝜑 → ( 𝑄) ∈ 𝐻)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092  wal 1545   = wceq 1547  wcel 2119  wral 3053  wss 3883  𝒫 cpw 4529  {csn 4555  wf 6481  cfv 6485  Basecbs 17170  0gc0g 17393  LSubSpclss 20921  LSAtomsclsa 39466  LSHypclsh 39467  LPolclpoN 41972
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8765  df-lpolN 41973
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator