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

Theorem lpolvN 42322
Description: The polarity of the whole space is the zero subspace. (Contributed by NM, 26-Nov-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
lpolv.v 𝑉 = (Base‘𝑊)
lpolv.z 0 = (0g𝑊)
lpolv.p 𝑃 = (LPol‘𝑊)
lpolv.w (𝜑𝑊𝑋)
lpolv.o (𝜑𝑃)
Assertion
Ref Expression
lpolvN (𝜑 → ( 𝑉) = { 0 })

Proof of Theorem lpolvN
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lpolv.o . . 3 (𝜑𝑃)
2 lpolv.w . . . 4 (𝜑𝑊𝑋)
3 lpolv.v . . . . 5 𝑉 = (Base‘𝑊)
4 eqid 2765 . . . . 5 (LSubSp‘𝑊) = (LSubSp‘𝑊)
5 lpolv.z . . . . 5 0 = (0g𝑊)
6 eqid 2765 . . . . 5 (LSAtoms‘𝑊) = (LSAtoms‘𝑊)
7 eqid 2765 . . . . 5 (LSHyp‘𝑊) = (LSHyp‘𝑊)
8 lpolv.p . . . . 5 𝑃 = (LPol‘𝑊)
93, 4, 5, 6, 7, 8islpolN 42319 . . . 4 (𝑊𝑋 → ( 𝑃 ↔ ( :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥)))))
102, 9syl 18 . . 3 (𝜑 → ( 𝑃 ↔ ( :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥)))))
111, 10mpbid 235 . 2 (𝜑 → ( :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))))
12 simpr1 1213 . 2 (( :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))) → ( 𝑉) = { 0 })
1311, 12syl 18 1 (𝜑 → ( 𝑉) = { 0 })
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103  wal 1568   = wceq 1570  wcel 2146  wral 3081  wss 3906  𝒫 cpw 4564  {csn 4591  wf 6536  cfv 6540  Basecbs 17295  0gc0g 17518  LSubSpclss 21106  LSAtomsclsa 39810  LSHypclsh 39811  LPolclpoN 42316
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8832  df-lpolN 42317
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator