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

Theorem cdlemksv 41043
Description: Part of proof of Lemma K of [Crawley] p. 118. Value of the sigma(p) function. (Contributed by NM, 26-Jun-2013.)
Hypotheses
Ref Expression
cdlemk.b 𝐵 = (Base‘𝐾)
cdlemk.l = (le‘𝐾)
cdlemk.j = (join‘𝐾)
cdlemk.a 𝐴 = (Atoms‘𝐾)
cdlemk.h 𝐻 = (LHyp‘𝐾)
cdlemk.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk.r 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk.m = (meet‘𝐾)
cdlemk.s 𝑆 = (𝑓𝑇 ↦ (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))))
Assertion
Ref Expression
cdlemksv (𝐺𝑇 → (𝑆𝐺) = (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
Distinct variable groups:   ,𝑓   ,𝑓   𝑓,𝐹   𝑓,𝑖,𝐺   𝑓,𝑁   𝑃,𝑓   𝑅,𝑓   𝑇,𝑓   𝑓,𝑊
Allowed substitution hints:   𝐴(𝑓,𝑖)   𝐵(𝑓,𝑖)   𝑃(𝑖)   𝑅(𝑖)   𝑆(𝑓,𝑖)   𝑇(𝑖)   𝐹(𝑖)   𝐻(𝑓,𝑖)   (𝑖)   𝐾(𝑓,𝑖)   (𝑓,𝑖)   (𝑖)   𝑁(𝑖)   𝑊(𝑖)

Proof of Theorem cdlemksv
StepHypRef Expression
1 fveq2 6832 . . . . . 6 (𝑓 = 𝐺 → (𝑅𝑓) = (𝑅𝐺))
21oveq2d 7372 . . . . 5 (𝑓 = 𝐺 → (𝑃 (𝑅𝑓)) = (𝑃 (𝑅𝐺)))
3 coeq1 5804 . . . . . . 7 (𝑓 = 𝐺 → (𝑓𝐹) = (𝐺𝐹))
43fveq2d 6836 . . . . . 6 (𝑓 = 𝐺 → (𝑅‘(𝑓𝐹)) = (𝑅‘(𝐺𝐹)))
54oveq2d 7372 . . . . 5 (𝑓 = 𝐺 → ((𝑁𝑃) (𝑅‘(𝑓𝐹))) = ((𝑁𝑃) (𝑅‘(𝐺𝐹))))
62, 5oveq12d 7374 . . . 4 (𝑓 = 𝐺 → ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹)))) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹)))))
76eqeq2d 2745 . . 3 (𝑓 = 𝐺 → ((𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹)))) ↔ (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
87riotabidv 7315 . 2 (𝑓 = 𝐺 → (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))) = (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
9 cdlemk.s . 2 𝑆 = (𝑓𝑇 ↦ (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))))
10 riotaex 7317 . 2 (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))) ∈ V
118, 9, 10fvmpt 6939 1 (𝐺𝑇 → (𝑆𝐺) = (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  cmpt 5177  ccnv 5621  ccom 5626  cfv 6490  crio 7312  (class class class)co 7356  Basecbs 17134  lecple 17182  joincjn 18232  meetcmee 18233  Atomscatm 39462  LHypclh 40183  LTrncltrn 40300  trLctrl 40357
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-riota 7313  df-ov 7359
This theorem is referenced by:  cdlemksel  41044  cdlemksv2  41046  cdlemkuvN  41063  cdlemkuel  41064  cdlemkuv2  41066  cdlemkuv-2N  41082  cdlemkuu  41094
  Copyright terms: Public domain W3C validator