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 42811
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 2766 . . . . 5 (LSubSp‘𝑊) = (LSubSp‘𝑊)
5 lpolv.z . . . . 5 0 = (0g‘𝑊)
6 eqid 2766 . . . . 5 (LSAtoms‘𝑊) = (LSAtoms‘𝑊)
7 eqid 2766 . . . . 5 (LSHyp‘𝑊) = (LSHyp‘𝑊)
8 lpolv.p . . . . 5 𝑃 = (LPol‘𝑊)
93, 4, 5, 6, 7, 8islpolN 42808 . . . 4 (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
102, 9syl 18 . . 3 (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
111, 10mpbid 235 . 2 (𝜑 → ( ⊥ :𝒫 𝑉⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑊)(( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))))
12 simpr1 1215 . 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 1104  ∀wal 1570   = wceq 1572   ∈ wcel 2150  ∀wral 3083   ⊆ wss 3899  𝒫 cpw 4559  {csn 4587  ⟶wf 6561  ‘cfv 6565  Basecbs 17433  0gc0g 17662  LSubSpclss 21259  LSAtomsclsa 40299  LSHypclsh 40300  LPolclpoN 42805
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-map 8886  df-lpolN 42806
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator