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

Theorem islpolN 41086
Description: The predicate "is a polarity". (Contributed by NM, 24-Nov-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
lpolset.v 𝑉 = (Base‘𝑊)
lpolset.s 𝑆 = (LSubSp‘𝑊)
lpolset.z 0 = (0g𝑊)
lpolset.a 𝐴 = (LSAtoms‘𝑊)
lpolset.h 𝐻 = (LSHyp‘𝑊)
lpolset.p 𝑃 = (LPol‘𝑊)
Assertion
Ref Expression
islpolN (𝑊𝑋 → ( 𝑃 ↔ ( :𝒫 𝑉𝑆 ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥)))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝑊   𝑥, ,𝑦
Allowed substitution hints:   𝐴(𝑦)   𝑃(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐻(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑋(𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem islpolN
Dummy variable 𝑜 is distinct from all other variables.
StepHypRef Expression
1 lpolset.v . . . 4 𝑉 = (Base‘𝑊)
2 lpolset.s . . . 4 𝑆 = (LSubSp‘𝑊)
3 lpolset.z . . . 4 0 = (0g𝑊)
4 lpolset.a . . . 4 𝐴 = (LSAtoms‘𝑊)
5 lpolset.h . . . 4 𝐻 = (LSHyp‘𝑊)
6 lpolset.p . . . 4 𝑃 = (LPol‘𝑊)
71, 2, 3, 4, 5, 6lpolsetN 41085 . . 3 (𝑊𝑋𝑃 = {𝑜 ∈ (𝑆m 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
87eleq2d 2811 . 2 (𝑊𝑋 → ( 𝑃 ∈ {𝑜 ∈ (𝑆m 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))}))
9 fveq1 6895 . . . . . 6 (𝑜 = → (𝑜𝑉) = ( 𝑉))
109eqeq1d 2727 . . . . 5 (𝑜 = → ((𝑜𝑉) = { 0 } ↔ ( 𝑉) = { 0 }))
11 fveq1 6895 . . . . . . . 8 (𝑜 = → (𝑜𝑦) = ( 𝑦))
12 fveq1 6895 . . . . . . . 8 (𝑜 = → (𝑜𝑥) = ( 𝑥))
1311, 12sseq12d 4010 . . . . . . 7 (𝑜 = → ((𝑜𝑦) ⊆ (𝑜𝑥) ↔ ( 𝑦) ⊆ ( 𝑥)))
1413imbi2d 339 . . . . . 6 (𝑜 = → (((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ↔ ((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥))))
15142albidv 1918 . . . . 5 (𝑜 = → (∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ↔ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥))))
1612eleq1d 2810 . . . . . . 7 (𝑜 = → ((𝑜𝑥) ∈ 𝐻 ↔ ( 𝑥) ∈ 𝐻))
17 id 22 . . . . . . . . 9 (𝑜 = 𝑜 = )
1817, 12fveq12d 6903 . . . . . . . 8 (𝑜 = → (𝑜‘(𝑜𝑥)) = ( ‘( 𝑥)))
1918eqeq1d 2727 . . . . . . 7 (𝑜 = → ((𝑜‘(𝑜𝑥)) = 𝑥 ↔ ( ‘( 𝑥)) = 𝑥))
2016, 19anbi12d 630 . . . . . 6 (𝑜 = → (((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥) ↔ (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥)))
2120ralbidv 3167 . . . . 5 (𝑜 = → (∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥) ↔ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥)))
2210, 15, 213anbi123d 1432 . . . 4 (𝑜 = → (((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥)) ↔ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))))
2322elrab 3679 . . 3 ( ∈ {𝑜 ∈ (𝑆m 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))} ↔ ( ∈ (𝑆m 𝒫 𝑉) ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))))
242fvexi 6910 . . . . 5 𝑆 ∈ V
251fvexi 6910 . . . . . 6 𝑉 ∈ V
2625pwex 5380 . . . . 5 𝒫 𝑉 ∈ V
2724, 26elmap 8890 . . . 4 ( ∈ (𝑆m 𝒫 𝑉) ↔ :𝒫 𝑉𝑆)
2827anbi1i 622 . . 3 (( ∈ (𝑆m 𝒫 𝑉) ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))) ↔ ( :𝒫 𝑉𝑆 ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))))
2923, 28bitri 274 . 2 ( ∈ {𝑜 ∈ (𝑆m 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))} ↔ ( :𝒫 𝑉𝑆 ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥))))
308, 29bitrdi 286 1 (𝑊𝑋 → ( 𝑃 ↔ ( :𝒫 𝑉𝑆 ∧ (( 𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → ( 𝑦) ⊆ ( 𝑥)) ∧ ∀𝑥𝐴 (( 𝑥) ∈ 𝐻 ∧ ( ‘( 𝑥)) = 𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084  wal 1531   = wceq 1533  wcel 2098  wral 3050  {crab 3418  wss 3944  𝒫 cpw 4604  {csn 4630  wf 6545  cfv 6549  (class class class)co 7419  m cmap 8845  Basecbs 17183  0gc0g 17424  LSubSpclss 20827  LSAtomsclsa 38576  LSHypclsh 38577  LPolclpoN 41083
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-sbc 3774  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-fv 6557  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8847  df-lpolN 41084
This theorem is referenced by:  islpoldN  41087  lpolfN  41088  lpolvN  41089  lpolconN  41090  lpolsatN  41091  lpolpolsatN  41092
  Copyright terms: Public domain W3C validator