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 42199
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 3472 . 2 (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2 fveq2 6877 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 dicval.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2814 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6877 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
6 dicval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
75, 6eqtr4di 2814 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
8 fveq2 6877 . . . . . . . . 9 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9 dicval.l . . . . . . . . 9 ≤ = (le‘𝐾)
108, 9eqtr4di 2814 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
1110breqd 5114 . . . . . . 7 (𝑘 = 𝐾 → (𝑟(le‘𝑘)𝑤 ↔ 𝑟 ≤ 𝑤))
1211notbid 321 . . . . . 6 (𝑘 = 𝐾 → (¬ 𝑟(le‘𝑘)𝑤 ↔ ¬ 𝑟 ≤ 𝑤))
137, 12rabeqbidv 3430 . . . . 5 (𝑘 = 𝐾 → {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} = {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤})
14 fveq2 6877 . . . . . . . . . . 11 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
1514fveq1d 6879 . . . . . . . . . 10 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
16 fveq2 6877 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (oc‘𝑘) = (oc‘𝐾))
1716fveq1d 6879 . . . . . . . . . . 11 (𝑘 = 𝐾 → ((oc‘𝑘)‘𝑤) = ((oc‘𝐾)‘𝑤))
1817fveqeq2d 6885 . . . . . . . . . 10 (𝑘 = 𝐾 → ((𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞 ↔ (𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞))
1915, 18riotaeqbidv 7372 . . . . . . . . 9 (𝑘 = 𝐾 → (℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞) = (℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞))
2019fveq2d 6881 . . . . . . . 8 (𝑘 = 𝐾 → (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)))
2120eqeq2d 2772 . . . . . . 7 (𝑘 = 𝐾 → (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ↔ 𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞))))
22 fveq2 6877 . . . . . . . . 9 (𝑘 = 𝐾 → (TEndo‘𝑘) = (TEndo‘𝐾))
2322fveq1d 6879 . . . . . . . 8 (𝑘 = 𝐾 → ((TEndo‘𝑘)‘𝑤) = ((TEndo‘𝐾)‘𝑤))
2423eleq2d 2847 . . . . . . 7 (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤) ↔ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤)))
2521, 24anbi12d 644 . . . . . 6 (𝑘 = 𝐾 → ((𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤)) ↔ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))))
2625opabbidv 5171 . . . . 5 (𝑘 = 𝐾 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})
2713, 26mpteq12dv 5192 . . . 4 (𝑘 = 𝐾 → (𝑞 ∈ {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))}) = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))}))
284, 27mpteq12dv 5192 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑞 ∈ {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))})) = (𝑤 ∈ 𝐻 ↦ (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑔‘((oc‘𝐾)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑤))})))
29 df-dic 42198 . . 3 DIsoC = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑞 ∈ {𝑟 ∈ (Atoms‘𝑘) ∣ ¬ 𝑟(le‘𝑘)𝑤} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑔‘((oc‘𝑘)‘𝑤)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝑘)‘𝑤))})))
3028, 29, 3mptfvmpt 7226 . 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 2145  {crab 3413  Vcvv 3451   class class class wbr 5103  {copab 5167   ↦ cmpt 5186  ‘cfv 6531  ℩crio 7368  lecple 17415  occoc 17416  Atomscatm 40288  LHypclh 41009  LTrncltrn 41126  TEndoctendo 41777  DIsoCcdic 42197
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-dic 42198
This theorem is used by:  dicfval  42200
  Copyright terms: Public domain W3C validator