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

Theorem lpolpolsatN 42466
Description: Property of a polarity. (Contributed by NM, 26-Nov-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
lpolpolsat.a 𝐴 = (LSAtoms‘𝑊)
lpolpolsat.p 𝑃 = (LPol‘𝑊)
lpolpolsat.w (𝜑 → 𝑊 ∈ 𝑋)
lpolpolsat.o (𝜑 → ⊥ ∈ 𝑃)
lpolpolsat.q (𝜑 → 𝑄 ∈ 𝐴)
Assertion
Ref Expression
lpolpolsatN (𝜑 → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)

Proof of Theorem lpolpolsatN
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lpolpolsat.o . . 3 (𝜑 → ⊥ ∈ 𝑃)
2 lpolpolsat.w . . . 4 (𝜑 → 𝑊 ∈ 𝑋)
3 eqid 2760 . . . . 5 (Base‘𝑊) = (Base‘𝑊)
4 eqid 2760 . . . . 5 (LSubSp‘𝑊) = (LSubSp‘𝑊)
5 eqid 2760 . . . . 5 (0g‘𝑊) = (0g‘𝑊)
6 lpolpolsat.a . . . . 5 𝐴 = (LSAtoms‘𝑊)
7 eqid 2760 . . . . 5 (LSHyp‘𝑊) = (LSHyp‘𝑊)
8 lpolpolsat.p . . . . 5 𝑃 = (LPol‘𝑊)
93, 4, 5, 6, 7, 8islpolN 42460 . . . 4 (𝑊 ∈ 𝑋 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
102, 9syl 18 . . 3 (𝜑 → ( ⊥ ∈ 𝑃 ↔ ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥)))))
111, 10mpbid 235 . 2 (𝜑 → ( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))))
12 simpr3 1215 . . 3 (( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))
13 lpolpolsat.q . . . 4 (𝜑 → 𝑄 ∈ 𝐴)
14 fveq2 6873 . . . . . . 7 (𝑥 = 𝑄 → ( ⊥ ‘𝑥) = ( ⊥ ‘𝑄))
1514eleq1d 2845 . . . . . 6 (𝑥 = 𝑄 → (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ↔ ( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊)))
16 2fveq3 6878 . . . . . . 7 (𝑥 = 𝑄 → ( ⊥ ‘( ⊥ ‘𝑥)) = ( ⊥ ‘( ⊥ ‘𝑄)))
17 id 23 . . . . . . 7 (𝑥 = 𝑄 → 𝑥 = 𝑄)
1816, 17eqeq12d 2776 . . . . . 6 (𝑥 = 𝑄 → (( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ↔ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄))
1915, 18anbi12d 644 . . . . 5 (𝑥 = 𝑄 → ((( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) ↔ (( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
2019rspcv 3572 . . . 4 (𝑄 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) → (( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
2113, 20syl 18 . . 3 (𝜑 → (∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥) → (( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)))
22 simpr 490 . . 3 ((( ⊥ ‘𝑄) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄) → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)
2312, 21, 22syl56 37 . 2 (𝜑 → (( ⊥ :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ⊥ ‘(Base‘𝑊)) = {(0g‘𝑊)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥 ⊆ 𝑦) → ( ⊥ ‘𝑦) ⊆ ( ⊥ ‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 (( ⊥ ‘𝑥) ∈ (LSHyp‘𝑊) ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))) → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄))
2411, 23mpd 16 1 (𝜑 → ( ⊥ ‘( ⊥ ‘𝑄)) = 𝑄)
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 2145  ∀wral 3076   ⊆ wss 3898  𝒫 cpw 4556  {csn 4583  ⟶wf 6523  ‘cfv 6527  Basecbs 17349  0gc0g 17572  LSubSpclss 21168  LSAtomsclsa 39951  LSHypclsh 39952  LPolclpoN 42457
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-map 8827  df-lpolN 42458
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator