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 41508
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 6882 . . . . . 6 (𝑓 = 𝐺 → (𝑅𝑓) = (𝑅𝐺))
21oveq2d 7427 . . . . 5 (𝑓 = 𝐺 → (𝑃 (𝑅𝑓)) = (𝑃 (𝑅𝐺)))
3 coeq1 5844 . . . . . . 7 (𝑓 = 𝐺 → (𝑓𝐹) = (𝐺𝐹))
43fveq2d 6886 . . . . . 6 (𝑓 = 𝐺 → (𝑅‘(𝑓𝐹)) = (𝑅‘(𝐺𝐹)))
54oveq2d 7427 . . . . 5 (𝑓 = 𝐺 → ((𝑁𝑃) (𝑅‘(𝑓𝐹))) = ((𝑁𝑃) (𝑅‘(𝐺𝐹))))
62, 5oveq12d 7429 . . . 4 (𝑓 = 𝐺 → ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹)))) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹)))))
76eqeq2d 2780 . . 3 (𝑓 = 𝐺 → ((𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹)))) ↔ (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
87riotabidv 7370 . 2 (𝑓 = 𝐺 → (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))) = (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
9 cdlemk.s . 2 𝑆 = (𝑓𝑇 ↦ (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))))
10 riotaex 7372 . 2 (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))) ∈ V
118, 9, 10fvmpt 6990 1 (𝐺𝑇 → (𝑆𝐺) = (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝐺)) ((𝑁𝑃) (𝑅‘(𝐺𝐹))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  cmpt 5196  ccnv 5661  ccom 5666  cfv 6537  crio 7367  (class class class)co 7411  Basecbs 17269  lecple 17317  joincjn 18367  meetcmee 18368  Atomscatm 39927  LHypclh 40648  LTrncltrn 40765  trLctrl 40822
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7368  df-ov 7414
This theorem is referenced by:  cdlemksel  41509  cdlemksv2  41511  cdlemkuvN  41528  cdlemkuel  41529  cdlemkuv2  41531  cdlemkuv-2N  41547  cdlemkuu  41559
  Copyright terms: Public domain W3C validator