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

Theorem lcvbr 39401
Description: The covers relation for a left vector space (or a left module). (cvbr 32374 analog.) (Contributed by NM, 9-Jan-2015.)
Hypotheses
Ref Expression
lcvfbr.s 𝑆 = (LSubSp‘𝑊)
lcvfbr.c 𝐶 = ( ⋖L𝑊)
lcvfbr.w (𝜑𝑊𝑋)
lcvfbr.t (𝜑𝑇𝑆)
lcvfbr.u (𝜑𝑈𝑆)
Assertion
Ref Expression
lcvbr (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
Distinct variable groups:   𝑆,𝑠   𝑊,𝑠   𝑇,𝑠   𝑈,𝑠
Allowed substitution hints:   𝜑(𝑠)   𝐶(𝑠)   𝑋(𝑠)

Proof of Theorem lcvbr
Dummy variables 𝑡 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lcvfbr.t . . 3 (𝜑𝑇𝑆)
2 lcvfbr.u . . 3 (𝜑𝑈𝑆)
3 eleq1 2825 . . . . . 6 (𝑡 = 𝑇 → (𝑡𝑆𝑇𝑆))
43anbi1d 632 . . . . 5 (𝑡 = 𝑇 → ((𝑡𝑆𝑢𝑆) ↔ (𝑇𝑆𝑢𝑆)))
5 psseq1 4044 . . . . . 6 (𝑡 = 𝑇 → (𝑡𝑢𝑇𝑢))
6 psseq1 4044 . . . . . . . . 9 (𝑡 = 𝑇 → (𝑡𝑠𝑇𝑠))
76anbi1d 632 . . . . . . . 8 (𝑡 = 𝑇 → ((𝑡𝑠𝑠𝑢) ↔ (𝑇𝑠𝑠𝑢)))
87rexbidv 3162 . . . . . . 7 (𝑡 = 𝑇 → (∃𝑠𝑆 (𝑡𝑠𝑠𝑢) ↔ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)))
98notbid 318 . . . . . 6 (𝑡 = 𝑇 → (¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢) ↔ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)))
105, 9anbi12d 633 . . . . 5 (𝑡 = 𝑇 → ((𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)) ↔ (𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢))))
114, 10anbi12d 633 . . . 4 (𝑡 = 𝑇 → (((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢))) ↔ ((𝑇𝑆𝑢𝑆) ∧ (𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)))))
12 eleq1 2825 . . . . . 6 (𝑢 = 𝑈 → (𝑢𝑆𝑈𝑆))
1312anbi2d 631 . . . . 5 (𝑢 = 𝑈 → ((𝑇𝑆𝑢𝑆) ↔ (𝑇𝑆𝑈𝑆)))
14 psseq2 4045 . . . . . 6 (𝑢 = 𝑈 → (𝑇𝑢𝑇𝑈))
15 psseq2 4045 . . . . . . . . 9 (𝑢 = 𝑈 → (𝑠𝑢𝑠𝑈))
1615anbi2d 631 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑇𝑠𝑠𝑢) ↔ (𝑇𝑠𝑠𝑈)))
1716rexbidv 3162 . . . . . . 7 (𝑢 = 𝑈 → (∃𝑠𝑆 (𝑇𝑠𝑠𝑢) ↔ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))
1817notbid 318 . . . . . 6 (𝑢 = 𝑈 → (¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢) ↔ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))
1914, 18anbi12d 633 . . . . 5 (𝑢 = 𝑈 → ((𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢)) ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
2013, 19anbi12d 633 . . . 4 (𝑢 = 𝑈 → (((𝑇𝑆𝑢𝑆) ∧ (𝑇𝑢 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑢))) ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
21 eqid 2737 . . . 4 {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))} = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}
2211, 20, 21brabg 5495 . . 3 ((𝑇𝑆𝑈𝑆) → (𝑇{⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}𝑈 ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
231, 2, 22syl2anc 585 . 2 (𝜑 → (𝑇{⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}𝑈 ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
24 lcvfbr.s . . . 4 𝑆 = (LSubSp‘𝑊)
25 lcvfbr.c . . . 4 𝐶 = ( ⋖L𝑊)
26 lcvfbr.w . . . 4 (𝜑𝑊𝑋)
2724, 25, 26lcvfbr 39400 . . 3 (𝜑𝐶 = {⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))})
2827breqd 5111 . 2 (𝜑 → (𝑇𝐶𝑈𝑇{⟨𝑡, 𝑢⟩ ∣ ((𝑡𝑆𝑢𝑆) ∧ (𝑡𝑢 ∧ ¬ ∃𝑠𝑆 (𝑡𝑠𝑠𝑢)))}𝑈))
291, 2jca 511 . . 3 (𝜑 → (𝑇𝑆𝑈𝑆))
3029biantrurd 532 . 2 (𝜑 → ((𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)) ↔ ((𝑇𝑆𝑈𝑆) ∧ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈)))))
3123, 28, 303bitr4d 311 1 (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇𝑈 ∧ ¬ ∃𝑠𝑆 (𝑇𝑠𝑠𝑈))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3062  wpss 3904   class class class wbr 5100  {copab 5162  cfv 6500  LSubSpclss 20897  L clcv 39398
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-lcv 39399
This theorem is referenced by:  lcvbr2  39402  lcvbr3  39403  lcvpss  39404  lcvnbtwn  39405  lsatcv0  39411  mapdcv  42040
  Copyright terms: Public domain W3C validator