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

Theorem dicffval 42423
Description: The partial isomorphism C for a lattice 𝐾. (Contributed by NM, 15-Dec-2013.)
Hypotheses
Ref Expression
dicval.l ≤ = (le‘𝐾)
dicval.a 𝐴 = (Atoms‘𝐾)
dicval.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
dicffval (𝐾 ∈ 𝑉 → (DIsoC‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})))
Distinct variable groups:   𝐴,𝑟   𝑤,𝐻   𝑓,𝑔,𝑞,𝑟,𝑠,𝑤,𝐾
Allowed substitution hints:   𝐴(𝑤, 𝑓, 𝑔, 𝑠, 𝑞)   𝐻(𝑓, 𝑔, 𝑠, 𝑟, 𝑞)   ≤ (𝑤, 𝑓, 𝑔, 𝑠, 𝑟, 𝑞)   𝑉(𝑤, 𝑓, 𝑔, 𝑠, 𝑟, 𝑞)

Proof of Theorem dicffval
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3475 . 2 (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2 fveq2 6908 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 dicval.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2816 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6908 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
6 dicval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
75, 6eqtr4di 2816 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
8 fveq2 6908 . . . . . . . . 9 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9 dicval.l . . . . . . . . 9 ≤ = (le‘𝐾)
108, 9eqtr4di 2816 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
1110breqd 5117 . . . . . . 7 (𝑘 = 𝐾 → (𝑟(le‘𝑘)𝑤 ↔ 𝑟 ≤ 𝑤))
1211notbid 321 . . . . . 6 (𝑘 = 𝐾 → (¬ 𝑟(le‘𝑘)𝑤 ↔ ¬ 𝑟 ≤ 𝑤))
137, 12rabeqbidv 3433 . . . . 5 (𝑘 = 𝐾 → {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} = {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤})
14 fveq2 6908 . . . . . . . . . . 11 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
1514fveq1d 6910 . . . . . . . . . 10 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
16 fveq2 6908 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (oc‘𝑘) = (oc‘𝐾))
1716fveq1d 6910 . . . . . . . . . . 11 (𝑘 = 𝐾 → ((oc‘𝑘)‘𝑤) = ((oc‘𝐾)‘𝑤))
1817fveqeq2d 6916 . . . . . . . . . 10 (𝑘 = 𝐾 → ((𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞 ↔ (𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞))
1915, 18riotaeqbidv 7403 . . . . . . . . 9 (𝑘 = 𝐾 → (℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞) = (℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞))
2019fveq2d 6912 . . . . . . . 8 (𝑘 = 𝐾 → (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)))
2120eqeq2d 2774 . . . . . . 7 (𝑘 = 𝐾 → (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ↔ 𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞))))
22 fveq2 6908 . . . . . . . . 9 (𝑘 = 𝐾 → (TEndo‘𝑘) = (TEndo‘𝐾))
2322fveq1d 6910 . . . . . . . 8 (𝑘 = 𝐾 → ((TEndo‘𝑘)‘𝑤) = ((TEndo‘𝐾)‘𝑤))
2423eleq2d 2850 . . . . . . 7 (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤) ↔ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤)))
2521, 24anbi12d 644 . . . . . 6 (𝑘 = 𝐾 → ((𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤)) ↔ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))))
2625opabbidv 5174 . . . . 5 (𝑘 = 𝐾 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})
2713, 26mpteq12dv 5195 . . . 4 (𝑘 = 𝐾 → (𝑞 ∈ {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))}) = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))}))
284, 27mpteq12dv 5195 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑞 ∈ {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))})) = (𝑤 ∈ 𝐻 ↦ (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})))
29 df-dic 42422 . . 3 DIsoC = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑞 ∈ {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))})))
3028, 29, 3mptfvmpt 7257 . 2 (𝐾 ∈ V → (DIsoC‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})))
311, 30syl 18 1 (𝐾 ∈ 𝑉 → (DIsoC‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   class class class wbr 5106  {copab 5170   ↦ cmpt 5189  ‘cfv 6558  ℩crio 7399  lecple 17464  occoc 17465  Atomscatm 40512  LHypclh 41233  LTrncltrn 41350  TEndoctendo 42001  DIsoCcdic 42421
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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395
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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-dic 42422
This theorem is used by:  dicfval  42424
  Copyright terms: Public domain W3C validator