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 42218
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 6916 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑆‘𝑑) = (𝑆‘𝐷))
2 cdlemk3.o2 . . . . . . . . 9 𝑄 = (𝑆‘𝐷)
31, 2eqtr4di 2816 . . . . . . . 8 (𝑑 = 𝐷 → (𝑆‘𝑑) = 𝑄)
43fveq1d 6918 . . . . . . 7 (𝑑 = 𝐷 → ((𝑆‘𝑑)‘𝑃) = (𝑄‘𝑃))
5 cnveq 5863 . . . . . . . . 9 (𝑑 = 𝐷 → ◡𝑑 = ◡𝐷)
65coeq2d 5851 . . . . . . . 8 (𝑑 = 𝐷 → (𝑒 ∘ ◡𝑑) = (𝑒 ∘ ◡𝐷))
76fveq2d 6920 . . . . . . 7 (𝑑 = 𝐷 → (𝑅‘(𝑒 ∘ ◡𝑑)) = (𝑅‘(𝑒 ∘ ◡𝐷)))
84, 7oveq12d 7469 . . . . . 6 (𝑑 = 𝐷 → (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑑))) = ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷))))
98oveq2d 7467 . . . . 5 (𝑑 = 𝐷 → ((𝑃 ∨ (𝑅‘𝑒)) ∧ (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑑)))) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷)))))
109eqeq2d 2774 . . . 4 (𝑑 = 𝐷 → ((𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑑)))) ↔ (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷))))))
1110riotabidv 7410 . . 3 (𝑑 = 𝐷 → (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑑))))) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷))))))
12 fveq2 6916 . . . . . . 7 (𝑒 = 𝐺 → (𝑅‘𝑒) = (𝑅‘𝐺))
1312oveq2d 7467 . . . . . 6 (𝑒 = 𝐺 → (𝑃 ∨ (𝑅‘𝑒)) = (𝑃 ∨ (𝑅‘𝐺)))
14 coeq1 5846 . . . . . . . 8 (𝑒 = 𝐺 → (𝑒 ∘ ◡𝐷) = (𝐺 ∘ ◡𝐷))
1514fveq2d 6920 . . . . . . 7 (𝑒 = 𝐺 → (𝑅‘(𝑒 ∘ ◡𝐷)) = (𝑅‘(𝐺 ∘ ◡𝐷)))
1615oveq2d 7467 . . . . . 6 (𝑒 = 𝐺 → ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷))) = ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))
1713, 16oveq12d 7469 . . . . 5 (𝑒 = 𝐺 → ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷)))) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))))
1817eqeq2d 2774 . . . 4 (𝑒 = 𝐺 → ((𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷)))) ↔ (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))))
1918riotabidv 7410 . . 3 (𝑒 = 𝐺 → (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷))))) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))))
20 cdlemk3.u1 . . 3 𝑌 = (𝑑 ∈ 𝑇, 𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑑))))))
21 riotaex 7412 . . 3 (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))) ∈ V
2211, 19, 20, 21ovmpo 7612 . 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 42167 . . 3 (𝐺 ∈ 𝑇 → (𝑍‘𝐺) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))))
3332adantl 487 . 2 ((𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑍‘𝐺) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))))
3422, 33eqtr4d 2801 1 ((𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐷𝑌𝐺) = (𝑍‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5192  ◡ccnv 5657   ∘ ccom 5662  ‘cfv 6566  ℩crio 7407  (class class class)co 7451   ∈ cmpo 7453  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-sbc 3743  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  df-oprab 7455  df-mpo 7456
This theorem is used by:  cdlemk31  42219  cdlemkuel-3  42221  cdlemkuv2-3N  42222  cdlemk18-3N  42223  cdlemk22-3  42224  cdlemkyu  42250
  Copyright terms: Public domain W3C validator