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 41508
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 41502 . . . 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 1197 . . 3 (( :𝒫 (Base‘𝑊)⟶(LSubSp‘𝑊) ∧ (( ‘(Base‘𝑊)) = {(0g𝑊)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑊) ∧ 𝑦 ⊆ (Base‘𝑊) ∧ 𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))) → ∀𝑥𝐴 (( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥))
13 lpolpolsat.q . . . 4 (𝜑𝑄𝐴)
14 fveq2 6876 . . . . . . 7 (𝑥 = 𝑄 → ( 𝑥) = ( 𝑄))
1514eleq1d 2819 . . . . . 6 (𝑥 = 𝑄 → (( 𝑥) ∈ (LSHyp‘𝑊) ↔ ( 𝑄) ∈ (LSHyp‘𝑊)))
16 2fveq3 6881 . . . . . . 7 (𝑥 = 𝑄 → ( ‘( 𝑥)) = ( ‘( 𝑄)))
17 id 22 . . . . . . 7 (𝑥 = 𝑄𝑥 = 𝑄)
1816, 17eqeq12d 2751 . . . . . 6 (𝑥 = 𝑄 → (( ‘( 𝑥)) = 𝑥 ↔ ( ‘( 𝑄)) = 𝑄))
1915, 18anbi12d 632 . . . . 5 (𝑥 = 𝑄 → ((( 𝑥) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑥)) = 𝑥) ↔ (( 𝑄) ∈ (LSHyp‘𝑊) ∧ ( ‘( 𝑄)) = 𝑄)))
2019rspcv 3597 . . . 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 1538   = wceq 1540  wcel 2108  wral 3051  wss 3926  𝒫 cpw 4575  {csn 4601  wf 6527  cfv 6531  Basecbs 17228  0gc0g 17453  LSubSpclss 20888  LSAtomsclsa 38992  LSHypclsh 38993  LPolclpoN 41499
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8842  df-lpolN 41500
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator