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

Theorem cdlemkuu 41702
Description: Convert between function and operation forms of 𝑌. TODO: Use operation form everywhere. (Contributed by NM, 6-Jul-2013.)
Hypotheses
Ref Expression
cdlemk3.b 𝐵 = (Base‘𝐾)
cdlemk3.l = (le‘𝐾)
cdlemk3.j = (join‘𝐾)
cdlemk3.m = (meet‘𝐾)
cdlemk3.a 𝐴 = (Atoms‘𝐾)
cdlemk3.h 𝐻 = (LHyp‘𝐾)
cdlemk3.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk3.r 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk3.s 𝑆 = (𝑓𝑇 ↦ (𝑖𝑇 (𝑖𝑃) = ((𝑃 (𝑅𝑓)) ((𝑁𝑃) (𝑅‘(𝑓𝐹))))))
cdlemk3.u1 𝑌 = (𝑑𝑇, 𝑒𝑇 ↦ (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) (((𝑆𝑑)‘𝑃) (𝑅‘(𝑒𝑑))))))
cdlemk3.o2 𝑄 = (𝑆𝐷)
cdlemk3.u2 𝑍 = (𝑒𝑇 ↦ (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷))))))
Assertion
Ref Expression
cdlemkuu ((𝐷𝑇𝐺𝑇) → (𝐷𝑌𝐺) = (𝑍𝐺))
Distinct variable groups:   𝑒,𝑑,𝑓,𝑖,   ,𝑖   ,𝑑,𝑒,𝑓,𝑖   𝐴,𝑖   𝑗,𝑑,𝐷,𝑒,𝑓,𝑖   𝑓,𝐹,𝑖   𝐺,𝑑,𝑒,𝑗   𝑖,𝐻   𝑖,𝐾   𝑓,𝑁,𝑖   𝑃,𝑑,𝑒,𝑓,𝑖   𝑄,𝑑,𝑒   𝑅,𝑑,𝑒,𝑓,𝑖   𝑇,𝑑,𝑒,𝑓,𝑖   𝑊,𝑑,𝑒,𝑓,𝑖
Allowed substitution hints:   𝐴(𝑒, 𝑓, 𝑗, 𝑑)   𝐵(𝑒, 𝑓, 𝑖, 𝑗, 𝑑)   𝑃(𝑗)   𝑄(𝑓, 𝑖, 𝑗)   𝑅(𝑗)   𝑆(𝑒, 𝑓, 𝑖, 𝑗, 𝑑)   𝑇(𝑗)   𝐹(𝑒, 𝑗, 𝑑)   𝐺(𝑓, 𝑖)   𝐻(𝑒, 𝑓, 𝑗, 𝑑)   (𝑗)   𝐾(𝑒, 𝑓, 𝑗, 𝑑)   (𝑒, 𝑓, 𝑗, 𝑑)   (𝑗)   𝑁(𝑒, 𝑗, 𝑑)   𝑊(𝑗)   𝑌(𝑒, 𝑓, 𝑖, 𝑗, 𝑑)   𝑍(𝑒, 𝑓, 𝑖, 𝑗, 𝑑)

Proof of Theorem cdlemkuu
StepHypRef Expression
1 fveq2 6885 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑆𝑑) = (𝑆𝐷))
2 cdlemk3.o2 . . . . . . . . 9 𝑄 = (𝑆𝐷)
31, 2eqtr4di 2818 . . . . . . . 8 (𝑑 = 𝐷 → (𝑆𝑑) = 𝑄)
43fveq1d 6887 . . . . . . 7 (𝑑 = 𝐷 → ((𝑆𝑑)‘𝑃) = (𝑄𝑃))
5 cnveq 5861 . . . . . . . . 9 (𝑑 = 𝐷𝑑 = 𝐷)
65coeq2d 5850 . . . . . . . 8 (𝑑 = 𝐷 → (𝑒𝑑) = (𝑒𝐷))
76fveq2d 6889 . . . . . . 7 (𝑑 = 𝐷 → (𝑅‘(𝑒𝑑)) = (𝑅‘(𝑒𝐷)))
84, 7oveq12d 7434 . . . . . 6 (𝑑 = 𝐷 → (((𝑆𝑑)‘𝑃) (𝑅‘(𝑒𝑑))) = ((𝑄𝑃) (𝑅‘(𝑒𝐷))))
98oveq2d 7432 . . . . 5 (𝑑 = 𝐷 → ((𝑃 (𝑅𝑒)) (((𝑆𝑑)‘𝑃) (𝑅‘(𝑒𝑑)))) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷)))))
109eqeq2d 2776 . . . 4 (𝑑 = 𝐷 → ((𝑗𝑃) = ((𝑃 (𝑅𝑒)) (((𝑆𝑑)‘𝑃) (𝑅‘(𝑒𝑑)))) ↔ (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷))))))
1110riotabidv 7375 . . 3 (𝑑 = 𝐷 → (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) (((𝑆𝑑)‘𝑃) (𝑅‘(𝑒𝑑))))) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷))))))
12 fveq2 6885 . . . . . . 7 (𝑒 = 𝐺 → (𝑅𝑒) = (𝑅𝐺))
1312oveq2d 7432 . . . . . 6 (𝑒 = 𝐺 → (𝑃 (𝑅𝑒)) = (𝑃 (𝑅𝐺)))
14 coeq1 5845 . . . . . . . 8 (𝑒 = 𝐺 → (𝑒𝐷) = (𝐺𝐷))
1514fveq2d 6889 . . . . . . 7 (𝑒 = 𝐺 → (𝑅‘(𝑒𝐷)) = (𝑅‘(𝐺𝐷)))
1615oveq2d 7432 . . . . . 6 (𝑒 = 𝐺 → ((𝑄𝑃) (𝑅‘(𝑒𝐷))) = ((𝑄𝑃) (𝑅‘(𝐺𝐷))))
1713, 16oveq12d 7434 . . . . 5 (𝑒 = 𝐺 → ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷)))) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷)))))
1817eqeq2d 2776 . . . 4 (𝑒 = 𝐺 → ((𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷)))) ↔ (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷))))))
1918riotabidv 7375 . . 3 (𝑒 = 𝐺 → (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷))))) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷))))))
20 cdlemk3.u1 . . 3 𝑌 = (𝑑𝑇, 𝑒𝑇 ↦ (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) (((𝑆𝑑)‘𝑃) (𝑅‘(𝑒𝑑))))))
21 riotaex 7377 . . 3 (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷))))) ∈ V
2211, 19, 20, 21ovmpo 7576 . 2 ((𝐷𝑇𝐺𝑇) → (𝐷𝑌𝐺) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷))))))
23 cdlemk3.b . . . 4 𝐵 = (Base‘𝐾)
24 cdlemk3.l . . . 4 = (le‘𝐾)
25 cdlemk3.j . . . 4 = (join‘𝐾)
26 cdlemk3.a . . . 4 𝐴 = (Atoms‘𝐾)
27 cdlemk3.h . . . 4 𝐻 = (LHyp‘𝐾)
28 cdlemk3.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
29 cdlemk3.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
30 cdlemk3.m . . . 4 = (meet‘𝐾)
31 cdlemk3.u2 . . . 4 𝑍 = (𝑒𝑇 ↦ (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝑒)) ((𝑄𝑃) (𝑅‘(𝑒𝐷))))))
3223, 24, 25, 26, 27, 28, 29, 30, 31cdlemksv 41651 . . 3 (𝐺𝑇 → (𝑍𝐺) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷))))))
3332adantl 487 . 2 ((𝐷𝑇𝐺𝑇) → (𝑍𝐺) = (𝑗𝑇 (𝑗𝑃) = ((𝑃 (𝑅𝐺)) ((𝑄𝑃) (𝑅‘(𝐺𝐷))))))
3422, 33eqtr4d 2803 1 ((𝐷𝑇𝐺𝑇) → (𝐷𝑌𝐺) = (𝑍𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  cmpt 5194  ccnv 5662  ccom 5667  cfv 6540  crio 7372  (class class class)co 7416  cmpo 7418  Basecbs 17286  lecple 17334  joincjn 18384  meetcmee 18385  Atomscatm 40070  LHypclh 40791  LTrncltrn 40908  trLctrl 40965
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421
This theorem is used by:  cdlemk31  41703  cdlemkuel-3  41705  cdlemkuv2-3N  41706  cdlemk18-3N  41707  cdlemk22-3  41708  cdlemkyu  41734
  Copyright terms: Public domain W3C validator