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

Theorem diaffval 40997
Description: The partial isomorphism A for a lattice 𝐾. (Contributed by NM, 15-Oct-2013.)
Hypotheses
Ref Expression
diaval.b 𝐵 = (Base‘𝐾)
diaval.l = (le‘𝐾)
diaval.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
diaffval (𝐾𝑉 → (DIsoA‘𝐾) = (𝑤𝐻 ↦ (𝑥 ∈ {𝑦𝐵𝑦 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥})))
Distinct variable groups:   𝑥,𝑤,𝑦,   𝑤,𝐵,𝑥,𝑦   𝑤,𝐻   𝑤,𝑓,𝑥,𝑦,𝐾
Allowed substitution hints:   𝐵(𝑓)   𝐻(𝑥,𝑦,𝑓)   (𝑓)   𝑉(𝑥,𝑦,𝑤,𝑓)

Proof of Theorem diaffval
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3465 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6840 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 diaval.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2782 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6840 . . . . . . 7 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
6 diaval.b . . . . . . 7 𝐵 = (Base‘𝐾)
75, 6eqtr4di 2782 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
8 fveq2 6840 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9 diaval.l . . . . . . . 8 = (le‘𝐾)
108, 9eqtr4di 2782 . . . . . . 7 (𝑘 = 𝐾 → (le‘𝑘) = )
1110breqd 5113 . . . . . 6 (𝑘 = 𝐾 → (𝑦(le‘𝑘)𝑤𝑦 𝑤))
127, 11rabeqbidv 3421 . . . . 5 (𝑘 = 𝐾 → {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} = {𝑦𝐵𝑦 𝑤})
13 fveq2 6840 . . . . . . 7 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
1413fveq1d 6842 . . . . . 6 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
15 fveq2 6840 . . . . . . . . 9 (𝑘 = 𝐾 → (trL‘𝑘) = (trL‘𝐾))
1615fveq1d 6842 . . . . . . . 8 (𝑘 = 𝐾 → ((trL‘𝑘)‘𝑤) = ((trL‘𝐾)‘𝑤))
1716fveq1d 6842 . . . . . . 7 (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘𝑓) = (((trL‘𝐾)‘𝑤)‘𝑓))
18 eqidd 2730 . . . . . . 7 (𝑘 = 𝐾𝑥 = 𝑥)
1917, 10, 18breq123d 5116 . . . . . 6 (𝑘 = 𝐾 → ((((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥 ↔ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥))
2014, 19rabeqbidv 3421 . . . . 5 (𝑘 = 𝐾 → {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥} = {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥})
2112, 20mpteq12dv 5189 . . . 4 (𝑘 = 𝐾 → (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥}) = (𝑥 ∈ {𝑦𝐵𝑦 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥}))
224, 21mpteq12dv 5189 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥})) = (𝑤𝐻 ↦ (𝑥 ∈ {𝑦𝐵𝑦 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥})))
23 df-disoa 40996 . . 3 DIsoA = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥})))
2422, 23, 3mptfvmpt 7184 . 2 (𝐾 ∈ V → (DIsoA‘𝐾) = (𝑤𝐻 ↦ (𝑥 ∈ {𝑦𝐵𝑦 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥})))
251, 24syl 17 1 (𝐾𝑉 → (DIsoA‘𝐾) = (𝑤𝐻 ↦ (𝑥 ∈ {𝑦𝐵𝑦 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) 𝑥})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  {crab 3402  Vcvv 3444   class class class wbr 5102  cmpt 5183  cfv 6499  Basecbs 17155  lecple 17203  LHypclh 39951  LTrncltrn 40068  trLctrl 40125  DIsoAcdia 40995
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pr 5382
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-disoa 40996
This theorem is referenced by:  diafval  40998
  Copyright terms: Public domain W3C validator