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

Theorem islshp 33067
Description: The predicate "is a hyperplane" (of a left module or left vector space). (Contributed by NM, 29-Jun-2014.)
Hypotheses
Ref Expression
lshpset.v 𝑉 = (Base‘𝑊)
lshpset.n 𝑁 = (LSpan‘𝑊)
lshpset.s 𝑆 = (LSubSp‘𝑊)
lshpset.h 𝐻 = (LSHyp‘𝑊)
Assertion
Ref Expression
islshp (𝑊𝑋 → (𝑈𝐻 ↔ (𝑈𝑆𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉)))
Distinct variable groups:   𝑣,𝑉   𝑣,𝑊   𝑣,𝑈
Allowed substitution hints:   𝑆(𝑣)   𝐻(𝑣)   𝑁(𝑣)   𝑋(𝑣)

Proof of Theorem islshp
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 lshpset.v . . . 4 𝑉 = (Base‘𝑊)
2 lshpset.n . . . 4 𝑁 = (LSpan‘𝑊)
3 lshpset.s . . . 4 𝑆 = (LSubSp‘𝑊)
4 lshpset.h . . . 4 𝐻 = (LSHyp‘𝑊)
51, 2, 3, 4lshpset 33066 . . 3 (𝑊𝑋𝐻 = {𝑠𝑆 ∣ (𝑠𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑠 ∪ {𝑣})) = 𝑉)})
65eleq2d 2672 . 2 (𝑊𝑋 → (𝑈𝐻𝑈 ∈ {𝑠𝑆 ∣ (𝑠𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑠 ∪ {𝑣})) = 𝑉)}))
7 neeq1 2843 . . . . 5 (𝑠 = 𝑈 → (𝑠𝑉𝑈𝑉))
8 uneq1 3721 . . . . . . . 8 (𝑠 = 𝑈 → (𝑠 ∪ {𝑣}) = (𝑈 ∪ {𝑣}))
98fveq2d 6091 . . . . . . 7 (𝑠 = 𝑈 → (𝑁‘(𝑠 ∪ {𝑣})) = (𝑁‘(𝑈 ∪ {𝑣})))
109eqeq1d 2611 . . . . . 6 (𝑠 = 𝑈 → ((𝑁‘(𝑠 ∪ {𝑣})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))
1110rexbidv 3033 . . . . 5 (𝑠 = 𝑈 → (∃𝑣𝑉 (𝑁‘(𝑠 ∪ {𝑣})) = 𝑉 ↔ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))
127, 11anbi12d 742 . . . 4 (𝑠 = 𝑈 → ((𝑠𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑠 ∪ {𝑣})) = 𝑉) ↔ (𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉)))
1312elrab 3330 . . 3 (𝑈 ∈ {𝑠𝑆 ∣ (𝑠𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑠 ∪ {𝑣})) = 𝑉)} ↔ (𝑈𝑆 ∧ (𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉)))
14 3anass 1034 . . 3 ((𝑈𝑆𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) ↔ (𝑈𝑆 ∧ (𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉)))
1513, 14bitr4i 265 . 2 (𝑈 ∈ {𝑠𝑆 ∣ (𝑠𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑠 ∪ {𝑣})) = 𝑉)} ↔ (𝑈𝑆𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))
166, 15syl6bb 274 1 (𝑊𝑋 → (𝑈𝐻 ↔ (𝑈𝑆𝑈𝑉 ∧ ∃𝑣𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382  w3a 1030   = wceq 1474  wcel 1976  wne 2779  wrex 2896  {crab 2899  cun 3537  {csn 4124  cfv 5789  Basecbs 15643  LSubSpclss 18701  LSpanclspn 18740  LSHypclsh 33063
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233  ax-ext 2589  ax-sep 4703  ax-nul 4711  ax-pr 4827
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-rab 2904  df-v 3174  df-sbc 3402  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-sn 4125  df-pr 4127  df-op 4131  df-uni 4367  df-br 4578  df-opab 4638  df-mpt 4639  df-id 4942  df-xp 5033  df-rel 5034  df-cnv 5035  df-co 5036  df-dm 5037  df-iota 5753  df-fun 5791  df-fv 5797  df-lshyp 33065
This theorem is referenced by:  islshpsm  33068  lshplss  33069  lshpne  33070  lshpnel2N  33073  lkrshp  33193  lshpset2N  33207  dochsatshp  35541
  Copyright terms: Public domain W3C validator