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

Theorem dihffval 40405
Description: The isomorphism H for a lattice 𝐾. Definition of isomorphism map in [Crawley] p. 122 line 3. (Contributed by NM, 28-Jan-2014.)
Hypotheses
Ref Expression
dihval.b 𝐵 = (Base‘𝐾)
dihval.l = (le‘𝐾)
dihval.j = (join‘𝐾)
dihval.m = (meet‘𝐾)
dihval.a 𝐴 = (Atoms‘𝐾)
dihval.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
dihffval (𝐾𝑉 → (DIsoH‘𝐾) = (𝑤𝐻 ↦ (𝑥𝐵 ↦ if(𝑥 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))))))
Distinct variable groups:   𝐴,𝑞   𝑤,𝐻   𝑢,𝑞,𝑤,𝑥,𝐾
Allowed substitution hints:   𝐴(𝑥,𝑤,𝑢)   𝐵(𝑥,𝑤,𝑢,𝑞)   𝐻(𝑥,𝑢,𝑞)   (𝑥,𝑤,𝑢,𝑞)   (𝑥,𝑤,𝑢,𝑞)   (𝑥,𝑤,𝑢,𝑞)   𝑉(𝑥,𝑤,𝑢,𝑞)

Proof of Theorem dihffval
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3492 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6891 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 dihval.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2789 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6891 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
6 dihval.b . . . . . 6 𝐵 = (Base‘𝐾)
75, 6eqtr4di 2789 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
8 fveq2 6891 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9 dihval.l . . . . . . . 8 = (le‘𝐾)
108, 9eqtr4di 2789 . . . . . . 7 (𝑘 = 𝐾 → (le‘𝑘) = )
1110breqd 5159 . . . . . 6 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑤𝑥 𝑤))
12 fveq2 6891 . . . . . . . 8 (𝑘 = 𝐾 → (DIsoB‘𝑘) = (DIsoB‘𝐾))
1312fveq1d 6893 . . . . . . 7 (𝑘 = 𝐾 → ((DIsoB‘𝑘)‘𝑤) = ((DIsoB‘𝐾)‘𝑤))
1413fveq1d 6893 . . . . . 6 (𝑘 = 𝐾 → (((DIsoB‘𝑘)‘𝑤)‘𝑥) = (((DIsoB‘𝐾)‘𝑤)‘𝑥))
15 fveq2 6891 . . . . . . . . 9 (𝑘 = 𝐾 → (DVecH‘𝑘) = (DVecH‘𝐾))
1615fveq1d 6893 . . . . . . . 8 (𝑘 = 𝐾 → ((DVecH‘𝑘)‘𝑤) = ((DVecH‘𝐾)‘𝑤))
1716fveq2d 6895 . . . . . . 7 (𝑘 = 𝐾 → (LSubSp‘((DVecH‘𝑘)‘𝑤)) = (LSubSp‘((DVecH‘𝐾)‘𝑤)))
18 fveq2 6891 . . . . . . . . 9 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
19 dihval.a . . . . . . . . 9 𝐴 = (Atoms‘𝐾)
2018, 19eqtr4di 2789 . . . . . . . 8 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
2110breqd 5159 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑞(le‘𝑘)𝑤𝑞 𝑤))
2221notbid 318 . . . . . . . . . 10 (𝑘 = 𝐾 → (¬ 𝑞(le‘𝑘)𝑤 ↔ ¬ 𝑞 𝑤))
23 fveq2 6891 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
24 dihval.j . . . . . . . . . . . . 13 = (join‘𝐾)
2523, 24eqtr4di 2789 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (join‘𝑘) = )
26 eqidd 2732 . . . . . . . . . . . 12 (𝑘 = 𝐾𝑞 = 𝑞)
27 fveq2 6891 . . . . . . . . . . . . . 14 (𝑘 = 𝐾 → (meet‘𝑘) = (meet‘𝐾))
28 dihval.m . . . . . . . . . . . . . 14 = (meet‘𝐾)
2927, 28eqtr4di 2789 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (meet‘𝑘) = )
3029oveqd 7429 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (𝑥(meet‘𝑘)𝑤) = (𝑥 𝑤))
3125, 26, 30oveq123d 7433 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = (𝑞 (𝑥 𝑤)))
3231eqeq1d 2733 . . . . . . . . . 10 (𝑘 = 𝐾 → ((𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥 ↔ (𝑞 (𝑥 𝑤)) = 𝑥))
3322, 32anbi12d 630 . . . . . . . . 9 (𝑘 = 𝐾 → ((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) ↔ (¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥)))
3416fveq2d 6895 . . . . . . . . . . 11 (𝑘 = 𝐾 → (LSSum‘((DVecH‘𝑘)‘𝑤)) = (LSSum‘((DVecH‘𝐾)‘𝑤)))
35 fveq2 6891 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (DIsoC‘𝑘) = (DIsoC‘𝐾))
3635fveq1d 6893 . . . . . . . . . . . 12 (𝑘 = 𝐾 → ((DIsoC‘𝑘)‘𝑤) = ((DIsoC‘𝐾)‘𝑤))
3736fveq1d 6893 . . . . . . . . . . 11 (𝑘 = 𝐾 → (((DIsoC‘𝑘)‘𝑤)‘𝑞) = (((DIsoC‘𝐾)‘𝑤)‘𝑞))
3813, 30fveq12d 6898 . . . . . . . . . . 11 (𝑘 = 𝐾 → (((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)) = (((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))
3934, 37, 38oveq123d 7433 . . . . . . . . . 10 (𝑘 = 𝐾 → ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))) = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))
4039eqeq2d 2742 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))) ↔ 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))
4133, 40imbi12d 344 . . . . . . . 8 (𝑘 = 𝐾 → (((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))) ↔ ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))
4220, 41raleqbidv 3341 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))) ↔ ∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))
4317, 42riotaeqbidv 7371 . . . . . 6 (𝑘 = 𝐾 → (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))))) = (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))
4411, 14, 43ifbieq12d 4556 . . . . 5 (𝑘 = 𝐾 → if(𝑥(le‘𝑘)𝑤, (((DIsoB‘𝑘)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))))) = if(𝑥 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))))
457, 44mpteq12dv 5239 . . . 4 (𝑘 = 𝐾 → (𝑥 ∈ (Base‘𝑘) ↦ if(𝑥(le‘𝑘)𝑤, (((DIsoB‘𝑘)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))))))) = (𝑥𝐵 ↦ if(𝑥 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))))
464, 45mpteq12dv 5239 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ (Base‘𝑘) ↦ if(𝑥(le‘𝑘)𝑤, (((DIsoB‘𝑘)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))))))) = (𝑤𝐻 ↦ (𝑥𝐵 ↦ if(𝑥 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))))))
47 df-dih 40404 . . 3 DIsoH = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ (Base‘𝑘) ↦ if(𝑥(le‘𝑘)𝑤, (((DIsoB‘𝑘)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))))))))
4846, 47, 3mptfvmpt 7232 . 2 (𝐾 ∈ V → (DIsoH‘𝐾) = (𝑤𝐻 ↦ (𝑥𝐵 ↦ if(𝑥 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))))))
491, 48syl 17 1 (𝐾𝑉 → (DIsoH‘𝐾) = (𝑤𝐻 ↦ (𝑥𝐵 ↦ if(𝑥 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2105  wral 3060  Vcvv 3473  ifcif 4528   class class class wbr 5148  cmpt 5231  cfv 6543  crio 7367  (class class class)co 7412  Basecbs 17149  lecple 17209  joincjn 18269  meetcmee 18270  LSSumclsm 19544  LSubSpclss 20687  Atomscatm 38437  LHypclh 39159  DVecHcdvh 40253  DIsoBcdib 40313  DIsoCcdic 40347  DIsoHcdih 40403
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7368  df-ov 7415  df-dih 40404
This theorem is referenced by:  dihfval  40406
  Copyright terms: Public domain W3C validator