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 41815
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 3474 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6862 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 dihval.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2814 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6862 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
6 dihval.b . . . . . 6 𝐵 = (Base‘𝐾)
75, 6eqtr4di 2814 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
8 fveq2 6862 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9 dihval.l . . . . . . . 8 = (le‘𝐾)
108, 9eqtr4di 2814 . . . . . . 7 (𝑘 = 𝐾 → (le‘𝑘) = )
1110breqd 5108 . . . . . 6 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑤𝑥 𝑤))
12 fveq2 6862 . . . . . . . 8 (𝑘 = 𝐾 → (DIsoB‘𝑘) = (DIsoB‘𝐾))
1312fveq1d 6864 . . . . . . 7 (𝑘 = 𝐾 → ((DIsoB‘𝑘)‘𝑤) = ((DIsoB‘𝐾)‘𝑤))
1413fveq1d 6864 . . . . . 6 (𝑘 = 𝐾 → (((DIsoB‘𝑘)‘𝑤)‘𝑥) = (((DIsoB‘𝐾)‘𝑤)‘𝑥))
15 fveq2 6862 . . . . . . . . 9 (𝑘 = 𝐾 → (DVecH‘𝑘) = (DVecH‘𝐾))
1615fveq1d 6864 . . . . . . . 8 (𝑘 = 𝐾 → ((DVecH‘𝑘)‘𝑤) = ((DVecH‘𝐾)‘𝑤))
1716fveq2d 6866 . . . . . . 7 (𝑘 = 𝐾 → (LSubSp‘((DVecH‘𝑘)‘𝑤)) = (LSubSp‘((DVecH‘𝐾)‘𝑤)))
18 fveq2 6862 . . . . . . . . 9 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
19 dihval.a . . . . . . . . 9 𝐴 = (Atoms‘𝐾)
2018, 19eqtr4di 2814 . . . . . . . 8 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
2110breqd 5108 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑞(le‘𝑘)𝑤𝑞 𝑤))
2221notbid 320 . . . . . . . . . 10 (𝑘 = 𝐾 → (¬ 𝑞(le‘𝑘)𝑤 ↔ ¬ 𝑞 𝑤))
23 fveq2 6862 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
24 dihval.j . . . . . . . . . . . . 13 = (join‘𝐾)
2523, 24eqtr4di 2814 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (join‘𝑘) = )
26 eqidd 2762 . . . . . . . . . . . 12 (𝑘 = 𝐾𝑞 = 𝑞)
27 fveq2 6862 . . . . . . . . . . . . . 14 (𝑘 = 𝐾 → (meet‘𝑘) = (meet‘𝐾))
28 dihval.m . . . . . . . . . . . . . 14 = (meet‘𝐾)
2927, 28eqtr4di 2814 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (meet‘𝑘) = )
3029oveqd 7408 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (𝑥(meet‘𝑘)𝑤) = (𝑥 𝑤))
3125, 26, 30oveq123d 7412 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = (𝑞 (𝑥 𝑤)))
3231eqeq1d 2763 . . . . . . . . . 10 (𝑘 = 𝐾 → ((𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥 ↔ (𝑞 (𝑥 𝑤)) = 𝑥))
3322, 32anbi12d 641 . . . . . . . . 9 (𝑘 = 𝐾 → ((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) ↔ (¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥)))
3416fveq2d 6866 . . . . . . . . . . 11 (𝑘 = 𝐾 → (LSSum‘((DVecH‘𝑘)‘𝑤)) = (LSSum‘((DVecH‘𝐾)‘𝑤)))
35 fveq2 6862 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (DIsoC‘𝑘) = (DIsoC‘𝐾))
3635fveq1d 6864 . . . . . . . . . . . 12 (𝑘 = 𝐾 → ((DIsoC‘𝑘)‘𝑤) = ((DIsoC‘𝐾)‘𝑤))
3736fveq1d 6864 . . . . . . . . . . 11 (𝑘 = 𝐾 → (((DIsoC‘𝑘)‘𝑤)‘𝑞) = (((DIsoC‘𝐾)‘𝑤)‘𝑞))
3813, 30fveq12d 6869 . . . . . . . . . . 11 (𝑘 = 𝐾 → (((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)) = (((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))
3934, 37, 38oveq123d 7412 . . . . . . . . . 10 (𝑘 = 𝐾 → ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))) = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))
4039eqeq2d 2772 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))) ↔ 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤)))))
4133, 40imbi12d 346 . . . . . . . 8 (𝑘 = 𝐾 → (((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))) ↔ ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))
4220, 41raleqbidv 3335 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))) ↔ ∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))
4317, 42riotaeqbidv 7351 . . . . . 6 (𝑘 = 𝐾 → (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤))))) = (𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞𝐴 ((¬ 𝑞 𝑤 ∧ (𝑞 (𝑥 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 𝑤))))))
4411, 14, 43ifbieq12d 4506 . . . . 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 5184 . . . 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 5184 . . 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 41814 . . 3 DIsoH = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ (Base‘𝑘) ↦ if(𝑥(le‘𝑘)𝑤, (((DIsoB‘𝑘)‘𝑤)‘𝑥), (𝑢 ∈ (LSubSp‘((DVecH‘𝑘)‘𝑤))∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑞(le‘𝑘)𝑤 ∧ (𝑞(join‘𝑘)(𝑥(meet‘𝑘)𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝑘)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝑘)‘𝑤))(((DIsoB‘𝑘)‘𝑤)‘(𝑥(meet‘𝑘)𝑤)))))))))
4846, 47, 3mptfvmpt 7207 . 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 399   = wceq 1559  wcel 2141  wral 3075  Vcvv 3453  ifcif 4477   class class class wbr 5097  cmpt 5178  cfv 6516  crio 7347  (class class class)co 7391  Basecbs 17236  lecple 17284  joincjn 18334  meetcmee 18335  LSSumclsm 19665  LSubSpclss 20986  Atomscatm 39848  LHypclh 40569  DVecHcdvh 41663  DIsoBcdib 41723  DIsoCcdic 41757  DIsoHcdih 41813
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-riota 7348  df-ov 7394  df-dih 41814
This theorem is referenced by:  dihfval  41816
  Copyright terms: Public domain W3C validator