matita/matita/lib/lambda/subterms/subterms.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 "lambda/background/preamble.ma".
  16
  17 include "lambda/notation/functions/variablereferencebyindex_2.ma".
  18 include "lambda/notation/functions/abstraction_2.ma".
  19 include "lambda/notation/functions/application_3.ma".
  20
  21 (* SUBSETS OF SUBTERMS ******************************************************)
  22
  23 (* Policy: boolean marks metavariables: b,c
  24            subterms metavariables: F,G,T,U,V,W
  25 *)
  26 (* Note: each subterm is marked with true if it belongs to the subset *)
  27 inductive subterms: Type[0] ≝
  28 | SVRef: bool → nat  → subterms
  29 | SAbst: bool → subterms → subterms
  30 | SAppl: bool → subterms → subterms → subterms
  31 .
  32
  33 interpretation "subterms construction (variable reference by index)"
  34    'VariableReferenceByIndex b i = (SVRef b i).
  35
  36 interpretation "subterms construction (abstraction)"
  37    'Abstraction b T = (SAbst b T).
  38
  39 interpretation "subterms construction (application)"
  40    'Application b V T = (SAppl b V T).
  41
  42 (*
  43 definition compatible_abst: predicate (relation term) ≝ λR.
  44                             ∀A1,A2. R A1 A2 → R (𝛌.A1) (𝛌.A2).
  45
  46 definition compatible_sn: predicate (relation term) ≝ λR.
  47                           ∀A,B1,B2. R B1 B2 → R (@B1.A) (@B2.A).
  48
  49 definition compatible_dx: predicate (relation term) ≝ λR.
  50                           ∀B,A1,A2. R A1 A2 → R (@B.A1) (@B.A2).
  51
  52 definition compatible_appl: predicate (relation term) ≝ λR.
  53                             ∀B1,B2. R B1 B2 → ∀A1,A2. R A1 A2 →
  54                             R (@B1.A1) (@B2.A2).
  55
  56 lemma star_compatible_abst: ∀R. compatible_abst R → compatible_abst (star … R).
  57 #R #HR #A1 #A2 #H elim H -A2 // /3 width=3/
  58 qed.
  59
  60 lemma star_compatible_sn: ∀R. compatible_sn R → compatible_sn (star … R).
  61 #R #HR #A #B1 #B2 #H elim H -B2 // /3 width=3/
  62 qed.
  63
  64 lemma star_compatible_dx: ∀R. compatible_dx R → compatible_dx (star … R).
  65 #R #HR #B #A1 #A2 #H elim H -A2 // /3 width=3/
  66 qed.
  67
  68 lemma star_compatible_appl: ∀R. reflexive ? R →
  69                             compatible_appl R → compatible_appl (star … R).
  70 #R #H1R #H2R #B1 #B2 #H elim H -B2 /3 width=1/ /3 width=5/
  71 qed.
  72 *)