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 41472
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 2735 . . . . 5 (Base‘𝑊) = (Base‘𝑊)
4 eqid 2735 . . . . 5 (LSubSp‘𝑊) = (LSubSp‘𝑊)
5 eqid 2735 . . . . 5 (0g𝑊) = (0g𝑊)
6 lpolpolsat.a . . . . 5 𝐴 = (LSAtoms‘𝑊)
7 eqid 2735 . . . . 5 (LSHyp‘𝑊) = (LSHyp‘𝑊)
8 lpolpolsat.p . . . . 5 𝑃 = (LPol‘𝑊)
93, 4, 5, 6, 7, 8islpolN 41466 . . . 4 (𝑊𝑋 → ( 𝑃 ↔ ( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥)))))
102, 9syl 17 . . 3 (𝜑 → ( 𝑃 ↔ ( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥)))))
111, 10mpbid 232 . 2 (𝜑 → ( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))))
12 simpr3 1195 . . 3 (( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))) → ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))
13 lpolpolsat.q . . . 4 (𝜑𝑄𝐴)
14 fveq2 6907 . . . . . . 7 (𝑥 = 𝑄 → ( 𝑥) = ( 𝑄))
1514eleq1d 2824 . . . . . 6 (𝑥 = 𝑄 → (( 𝑥) ∈ (LSHyp‘𝑊) ↔ ( 𝑄) ∈ (LSHyp‘𝑊)))
16 2fveq3 6912 . . . . . . 7 (𝑥 = 𝑄 → ( ‘( 𝑥)) = ( ‘( 𝑄)))
17 id 22 . . . . . . 7 (𝑥 = 𝑄𝑥 = 𝑄)
1816, 17eqeq12d 2751 . . . . . 6 (𝑥 = 𝑄 → (( ‘( 𝑥)) = 𝑥 ↔ ( ‘( 𝑄)) = 𝑄))
1915, 18anbi12d 632 . . . . 5 (𝑥 = 𝑄 → ((( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥) ↔ (( 𝑄) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑄)) = 𝑄)))
2019rspcv 3618 . . . 4 (𝑄𝐴 → (∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥) → (( 𝑄) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑄)) = 𝑄)))
2113, 20syl 17 . . 3 (𝜑 → (∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥) → (( 𝑄) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑄)) = 𝑄)))
22 simpr 484 . . 3 ((( 𝑄) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑄)) = 𝑄) → ( ‘( 𝑄)) = 𝑄)
2312, 21, 22syl56 36 . 2 (𝜑 → (( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))) → ( ‘( 𝑄)) = 𝑄))
2411, 23mpd 15 1 (𝜑 → ( ‘( 𝑄)) = 𝑄)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086  wal 1535   = wceq 1537  wcel 2106  wral 3059  wss 3963  𝒫 cpw 4605  {csn 4631  wf 6559  cfv 6563  Basecbs 17245  0gc0g 17486  LSubSpclss 20947  LSAtomsclsa 38956  LSHypclsh 38957  LPolclpoN 41463
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-map 8867  df-lpolN 41464
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator