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 42734
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 2763 . . . . 5 (LSubSp‘𝑊) = (LSubSp‘𝑊)
5 lpolv.z . . . . 5 0 = (0g‘𝑊)
6 eqid 2763 . . . . 5 (LSAtoms‘𝑊) = (LSAtoms‘𝑊)
7 eqid 2763 . . . . 5 (LSHyp‘𝑊) = (LSHyp‘𝑊)
8 lpolv.p . . . . 5 𝑃 = (LPol‘𝑊)
93, 4, 5, 6, 7, 8islpolN 42731 . . . 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 2147  ∀wral 3080   ⊆ wss 3900  𝒫 cpw 4560  {csn 4588  ⟶wf 6551  ‘cfv 6555  Basecbs 17413  0gc0g 17636  LSubSpclss 21233  LSAtomsclsa 40222  LSHypclsh 40223  LPolclpoN 42728
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-lpolN 42729
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator