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

Theorem cdlemkuvN 41737
Description: Part of proof of Lemma K of [Crawley] p. 118. Value of the sigma1 (p) function 𝑈. (Contributed by NM, 2-Jul-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemk1.b 𝐵 = (Base‘𝐾)
cdlemk1.l = (le‘𝐾)
cdlemk1.j = (join‘𝐾)
cdlemk1.m = (meet‘𝐾)
cdlemk1.a 𝐴 = (Atoms‘𝐾)
cdlemk1.h 𝐻 = (LHyp‘𝐾)
cdlemk1.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk1.r 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk1.s 𝑆 = (𝑓𝑇 ↦ (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))))
cdlemk1.o 𝑂 = (𝑆𝐷)
cdlemk1.u 𝑈 = (𝑒𝑇 ↦ (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑂𝑃) (𝑅‘(𝑒𝐷))))))
Assertion
Ref Expression
cdlemkuvN (𝐺𝑇 → (𝑈𝐺) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑂𝑃) (𝑅‘(𝐺𝐷))))))
Distinct variable groups:   𝑓,𝑖,   ,𝑖   ,𝑓,𝑖   𝐴,𝑖   𝐷,𝑓,𝑖   𝑓,𝐹,𝑖   𝑖,𝐻   𝑖,𝐾   𝑓,𝑁,𝑖   𝑃,𝑓,𝑖   𝑅,𝑓,𝑖   𝑇,𝑓,𝑖   𝑓,𝑊,𝑖   ,𝑒   ,𝑒   𝐷,𝑒   𝑒,𝑗,𝐺   𝑒,𝑂   𝑃,𝑒   𝑅,𝑒   𝑇,𝑒   𝑒,𝑊
Allowed substitution hints:   𝐴(𝑒, 𝑓, 𝑗)   𝐵(𝑒, 𝑓, 𝑖, 𝑗)   𝐷(𝑗)   𝑃(𝑗)   𝑅(𝑗)   𝑆(𝑒, 𝑓, 𝑖, 𝑗)   𝑇(𝑗)   𝑈(𝑒, 𝑓, 𝑖, 𝑗)   𝐹(𝑒, 𝑗)   𝐺(𝑓, 𝑖)   𝐻(𝑒, 𝑓, 𝑗)   (𝑗)   𝐾(𝑒, 𝑓, 𝑗)   (𝑒, 𝑓, 𝑗)   (𝑗)   𝑁(𝑒, 𝑗)   𝑂(𝑓, 𝑖, 𝑗)   𝑊(𝑗)

Proof of Theorem cdlemkuvN
StepHypRef Expression
1 cdlemk1.b . 2 𝐵 = (Base‘𝐾)
2 cdlemk1.l . 2 = (le‘𝐾)
3 cdlemk1.j . 2 = (join‘𝐾)
4 cdlemk1.a . 2 𝐴 = (Atoms‘𝐾)
5 cdlemk1.h . 2 𝐻 = (LHyp‘𝐾)
6 cdlemk1.t . 2 𝑇 = ((LTrn‘𝐾)‘𝑊)
7 cdlemk1.r . 2 𝑅 = ((trL‘𝐾)‘𝑊)
8 cdlemk1.m . 2 = (meet‘𝐾)
9 cdlemk1.u . 2 𝑈 = (𝑒𝑇 ↦ (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑂𝑃) (𝑅‘(𝑒𝐷))))))
101, 2, 3, 4, 5, 6, 7, 8, 9cdlemksv 41717 1 (𝐺𝑇 → (𝑈𝐺) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑂𝑃) (𝑅‘(𝐺𝐷))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  cmpt 5186  ccnv 5654  ccom 5659  cfv 6533  crio 7369  (class class class)co 7413  Basecbs 17301  lecple 17349  joincjn 18399  meetcmee 18400  Atomscatm 40136  LHypclh 40857  LTrncltrn 40974  trLctrl 41031
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  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 2100  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-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-riota 7370  df-ov 7416
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator