matita/matita/contribs/lambdadelta/basic_2A/multiple/llor.ma

   1 (**************************************************************************)
   2 (*       ___                                                              *)
   3 (*      ||M||                                                             *)
   4 (*      ||A||       A project by Andrea Asperti                           *)
   5 (*      ||T||                                                             *)
   6 (*      ||I||       Developers:                                           *)
   7 (*      ||T||         The HELM team.                                      *)
   8 (*      ||A||         http://helm.cs.unibo.it                             *)
   9 (*      \   /                                                             *)
  10 (*       \ /        This file is distributed under the terms of the       *)
  11 (*        v         GNU General Public License Version 2                  *)
  12 (*                                                                        *)
  13 (**************************************************************************)
  14
  15 include "basic_2A/notation/relations/lazyor_5.ma".
  16 include "basic_2A/multiple/frees.ma".
  17
  18 (* POINTWISE UNION FOR LOCAL ENVIRONMENTS ***********************************)
  19
  20 definition llor: ynat → relation4 term lenv lenv lenv ≝ λl,T,L2,L1,L.
  21                  ∧∧ |L1| = |L2| & |L1| = |L|
  22                   & (∀I1,I2,I,K1,K2,K,V1,V2,V,i.
  23                        ⬇[i] L1 ≡ K1.ⓑ{I1}V1 → ⬇[i] L2 ≡ K2.ⓑ{I2}V2 → ⬇[i] L ≡ K.ⓑ{I}V → ∨∨
  24                        (∧∧ yinj i < l & I1 = I & V1 = V) |
  25                        (∧∧ (L1 ⊢ i ϵ 𝐅*[l]⦃T⦄ → ⊥) & I1 = I & V1 = V) |
  26                        (∧∧ l ≤ yinj i & L1 ⊢ i ϵ 𝐅*[l]⦃T⦄ & I2 = I & V2 = V)
  27                     ).
  28
  29 interpretation
  30    "lazy union (local environment)"
  31    'LazyOr L1 T l L2 L = (llor l T L2 L1 L).
  32
  33 (* Basic properties *********************************************************)
  34
  35 (* Note: this can be proved by llor_skip *)
  36 lemma llor_atom: ∀T,l. ⋆ ⋓[T, l] ⋆ ≡ ⋆.
  37 #T #l @and3_intro //
  38 #I1 #I2 #I #K1 #K2 #K #V1 #V2 #V #i #HLK1
  39 elim (drop_inv_atom1 … HLK1) -HLK1 #H destruct
  40 qed.