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 42167
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 6916 . . . . . 6 (𝑓 = 𝐺 → (𝑅‘𝑓) = (𝑅‘𝐺))
21oveq2d 7467 . . . . 5 (𝑓 = 𝐺 → (𝑃 ∨ (𝑅‘𝑓)) = (𝑃 ∨ (𝑅‘𝐺)))
3 coeq1 5846 . . . . . . 7 (𝑓 = 𝐺 → (𝑓 ∘ ◡𝐹) = (𝐺 ∘ ◡𝐹))
43fveq2d 6920 . . . . . 6 (𝑓 = 𝐺 → (𝑅‘(𝑓 ∘ ◡𝐹)) = (𝑅‘(𝐺 ∘ ◡𝐹)))
54oveq2d 7467 . . . . 5 (𝑓 = 𝐺 → ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))) = ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))
62, 5oveq12d 7469 . . . 4 (𝑓 = 𝐺 → ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹)))))
76eqeq2d 2774 . . 3 (𝑓 = 𝐺 → ((𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))) ↔ (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))))
87riotabidv 7410 . 2 (𝑓 = 𝐺 → (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))))
9 cdlemk.s . 2 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))))
10 riotaex 7412 . 2 (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))) ∈ V
118, 9, 10fvmpt 7024 1 (𝐺 ∈ 𝑇 → (𝑆‘𝐺) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5192  ◡ccnv 5657   ∘ ccom 5662  ‘cfv 6566  ℩crio 7407  (class class class)co 7451  Basecbs 17431  lecple 17479  joincjn 18535  meetcmee 18536  Atomscatm 40586  LHypclh 41307  LTrncltrn 41424  trLctrl 41481
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-riota 7408  df-ov 7454
This theorem is used by:  cdlemksel  42168  cdlemksv2  42170  cdlemkuvN  42187  cdlemkuel  42188  cdlemkuv2  42190  cdlemkuv-2N  42206  cdlemkuu  42218
  Copyright terms: Public domain W3C validator