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 42038
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 6890 . . . . . 6 (𝑓 = 𝐺 → (𝑅‘𝑓) = (𝑅‘𝐺))
21oveq2d 7440 . . . . 5 (𝑓 = 𝐺 → (𝑃 ∨ (𝑅‘𝑓)) = (𝑃 ∨ (𝑅‘𝐺)))
3 coeq1 5836 . . . . . . 7 (𝑓 = 𝐺 → (𝑓 ∘ ◡𝐹) = (𝐺 ∘ ◡𝐹))
43fveq2d 6894 . . . . . 6 (𝑓 = 𝐺 → (𝑅‘(𝑓 ∘ ◡𝐹)) = (𝑅‘(𝐺 ∘ ◡𝐹)))
54oveq2d 7440 . . . . 5 (𝑓 = 𝐺 → ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))) = ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))
62, 5oveq12d 7442 . . . 4 (𝑓 = 𝐺 → ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹)))))
76eqeq2d 2771 . . 3 (𝑓 = 𝐺 → ((𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))) ↔ (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))))
87riotabidv 7383 . 2 (𝑓 = 𝐺 → (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))))
9 cdlemk.s . 2 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))))
10 riotaex 7385 . 2 (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))) ∈ V
118, 9, 10fvmpt 6998 1 (𝐺 ∈ 𝑇 → (𝑆‘𝐺) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144   ↦ cmpt 5185  ◡ccnv 5650   ∘ ccom 5655  ‘cfv 6543  ℩crio 7380  (class class class)co 7424  Basecbs 17396  lecple 17444  joincjn 18494  meetcmee 18495  Atomscatm 40457  LHypclh 41178  LTrncltrn 41295  trLctrl 41352
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6497  df-fun 6545  df-fv 6551  df-riota 7381  df-ov 7427
This theorem is used by:  cdlemksel  42039  cdlemksv2  42041  cdlemkuvN  42058  cdlemkuel  42059  cdlemkuv2  42061  cdlemkuv-2N  42077  cdlemkuu  42089
  Copyright terms: Public domain W3C validator