(**************************************************************************)
include "logic/equality.ma".
+include "logic/cprop_connectives.ma".
-inductive And (A,B:CProp) : CProp ≝
- conj: A → B → And A B.
-
-interpretation "constructive and" 'and x y = (And x y).
+record powerset (A : Type) : Type ≝ { char : A → CProp }.
-inductive exT2 (A:Type) (P,Q:A→CProp) : CProp ≝
- ex_introT2: ∀w:A. P w → Q w → exT2 A P Q.
+interpretation "char" 'subset p = (mk_powerset _ p).
-record powerset (A: Type) : Type ≝ { char: A → CProp }.
+interpretation "pwset" 'powerset a = (powerset a).
-notation "hvbox(2 \sup A)" non associative with precedence 45
-for @{ 'powerset $A }.
+interpretation "in" 'mem a X = (char _ X a).
-interpretation "powerset" 'powerset A = (powerset A).
+definition subseteq ≝ λA.λu,v:\Omega \sup A.∀x.x ∈ u → x ∈ v.
-definition mem ≝ λA.λS:2 \sup A.λx:A. match S with [mk_powerset c ⇒ c x].
+interpretation "subseteq" 'subseteq u v = (subseteq _ u v).
-notation "hvbox(a break ∈ b)" non associative with precedence 45
-for @{ 'mem $a $b }.
+definition overlaps ≝ λA.λU,V : Ω \sup A. exT2 ? (λx.x ∈ U) (λx.x ∈ V).
-interpretation "mem" 'mem a S = (mem _ S a).
+interpretation "overlaps" 'overlaps u v = (overlaps _ u v).
-record axiom_set : Type ≝
- { A:> Type;
- i: A → Type;
- C: ∀a:A. i a → 2 \sup A
- }.
+definition intersect ≝ λA.λu,v:Ω\sup A.{ y | y ∈ u ∧ y ∈ v }.
+
+interpretation "intersect" 'intersects u v = (intersect _ u v).
+
+record axiom_set : Type ≝ {
+ A:> Type;
+ i: A → Type;
+ C: ∀a:A. i a → Ω \sup A
+}.
-inductive for_all (A: axiom_set) (U,V: 2 \sup A) (covers: A → CProp) : CProp ≝
+inductive for_all (A: axiom_set) (U,V: Ω \sup A) (covers: A → CProp) : CProp ≝
iter: (∀a:A.a ∈ V → covers a) → for_all A U V covers.
-inductive covers (A: axiom_set) (U: 2 \sup A) : A → CProp ≝
+inductive covers (A: axiom_set) (U: \Omega \sup A) : A → CProp ≝
refl: ∀a:A. a ∈ U → covers A U a
| infinity: ∀a:A. ∀j: i ? a. for_all A U (C ? a j) (covers A U) → covers A U a.
interpretation "covers" 'covers a U = (covers _ U a).
definition covers_elim ≝
- λA:axiom_set.λU: 2 \sup A.λP:2 \sup A.
- λH1:∀a:A. a ∈ U → a ∈ P.
- λH2:∀a:A.∀j:i ? a. C ? a j ◃ U → (∀b. b ∈ C ? a j → b ∈ P) → a ∈ P.
+ λA:axiom_set.λU: \Omega \sup A.λP:\Omega \sup A.
+ λH1: U ⊆ P.
+ λH2:∀a:A.∀j:i ? a. C ? a j ◃ U → C ? a j ⊆ P → a ∈ P.
let rec aux (a:A) (p:a ◃ U) on p : a ∈ P ≝
match p return λaa.λ_:aa ◃ U.aa ∈ P with
[ refl a q ⇒ H1 a q
| infinity a j q ⇒
H2 a j q
- match q return λ_:(C ? a j) ◃ U.∀b. b ∈ (C ? a j) → b ∈ P with
+ match q return λ_:(C ? a j) ◃ U. C ? a j ⊆ P with
[ iter f ⇒ λb.λr. aux b (f b r) ]]
in
aux.
-inductive ex_such (A : axiom_set) (U,V : 2 \sup A) (fish: A → CProp) : CProp ≝
+inductive ex_such (A : axiom_set) (U,V : \Omega \sup A) (fish: A → CProp) : CProp ≝
found : ∀a. a ∈ V → fish a → ex_such A U V fish.
-coinductive fish (A:axiom_set) (U: 2 \sup A) : A → CProp ≝
+coinductive fish (A:axiom_set) (U: \Omega \sup A) : A → CProp ≝
mk_fish: ∀a:A. a ∈ U → (∀j: i ? a. ex_such A U (C ? a j) (fish A U)) → fish A U a.
notation "hvbox(a break ⋉ b)" non associative with precedence 45
interpretation "fishl" 'fish A U = (ex_such _ U A (fish _ U)).
interpretation "fish" 'fish a U = (fish _ U a).
-let corec fish_rec (A:axiom_set) (U: 2 \sup A)
- (P: 2 \sup A) (H1: ∀a:A. a ∈ P → a ∈ U)
- (H2: ∀a:A. a ∈ P → ∀j: i ? a. exT2 ? (λy.y ∈ C ? a j) (λy.y ∈ P)) :
+let corec fish_rec (A:axiom_set) (U: \Omega \sup A)
+ (P: Ω \sup A) (H1: P ⊆ U)
+ (H2: ∀a:A. a ∈ P → ∀j: i ? a. C ? a j ≬ P):
∀a:A. ∀p: a ∈ P. a ⋉ U ≝
λa,p.
mk_fish A U a
theorem transitivity: ∀A:axiom_set.∀a:A.∀U,V. a ◃ U → U ◃ V → a ◃ V.
intros;
- apply (covers_elim ?? (mk_powerset A (λa.a ◃ V)) ??? H); simplify; intros;
+ apply (covers_elim ?? {a | a ◃ V} ??? H); simplify; intros;
[ cases H1 in H2; apply H2;
| apply infinity;
[ assumption
assumption]]
qed.
+theorem covers_elim2:
+ ∀A: axiom_set. ∀U:Ω \sup A.∀P: A → CProp.
+ (∀a:A. a ∈ U → P a) →
+ (∀a:A.∀V:Ω \sup A. a ◃ V → V ◃ U → (∀y. y ∈ V → P y) → P a) →
+ ∀a:A. a ◃ U → P a.
+ intros;
+ change with (a ∈ {a | P a});
+ apply (covers_elim ?????? H2);
+ [ intros 2; simplify; apply H; assumption
+ | intros;
+ simplify in H4 ⊢ %;
+ apply H1;
+ [ apply (C ? a1 j);
+ | autobatch;
+ | assumption;
+ | assumption]]
+qed.
+
theorem coreflexivity: ∀A:axiom_set.∀a:A.∀V. a ⋉ V → a ∈ V.
intros;
cases H;
theorem cotransitivity:
∀A:axiom_set.∀a:A.∀U,V. a ⋉ U → (∀b:A. b ⋉ U → b ∈ V) → a ⋉ V.
intros;
- apply (fish_rec ?? (mk_powerset A (λa.a ⋉ U)) ??? H); simplify; intros;
+ apply (fish_rec ?? {a|a ⋉ U} ??? H); simplify; intros;
[ apply H1; apply H2;
| cases H2 in j; clear H2; intro i;
cases (H4 i); clear H4; exists[apply a3] assumption]
theorem compatibility: ∀A:axiom_set.∀a:A.∀U,V. a ⋉ V → a ◃ U → U ⋉ V.
intros;
generalize in match H; clear H;
- apply (covers_elim ?? (mk_powerset A (λa.a ⋉ V → U ⋉ V)) ??? H1);
+ apply (covers_elim ?? {a|a ⋉ V → U ⋉ V} ??? H1);
clear H1; simplify; intros;
- [ exists [apply a1] assumption
+ [ exists [apply x] assumption
| cases H2 in j H H1; clear H2 a1; intros;
cases (H1 i); clear H1; apply (H3 a1); assumption]
qed.
-definition singleton ≝ λA:axiom_set.λa:A.mk_powerset ? (λb:A.a=b).
-
-notation "hvbox({ term 19 a })" with precedence 90 for @{ 'singl $a}.
-
-interpretation "singleton" 'singl a = (singleton _ a).
-
-definition leq ≝ λA:axiom_set.λa,b:A. a ◃ {b}.
+definition leq ≝ λA:axiom_set.λa,b:A. a ◃ {y|b=y}.
interpretation "covered by one" 'leq a b = (leq _ a b).
definition uparrow ≝ λA:axiom_set.λa:A.mk_powerset ? (λb:A. a ≤ b).
-notation "↑a" with precedence 80 for @{ 'uparrow $a }.
-
interpretation "uparrow" 'uparrow a = (uparrow _ a).
-definition overlaps ≝ λA:Type.λU,V:2 \sup A.exT2 ? (λa:A. a ∈ U) (λa.a ∈ V).
-
-notation "hvbox(a break ≬ b)" non associative with precedence 45
-for @{ 'overlaps $a $b }.
-
-interpretation "overlaps" 'overlaps U V = (overlaps _ U V).
-
-definition intersects ≝ λA:Type.λU,V:2 \sup A.mk_powerset ? (λa:A. a ∈ U ∧ a ∈ V).
-
-notation "hvbox(a break ∩ b)" non associative with precedence 55
-for @{ 'intersects $a $b }.
-
-interpretation "intersects" 'intersects U V = (intersects _ U V).
-
-definition downarrow ≝ λA:axiom_set.λU:2 \sup A.mk_powerset ? (λa:A. ↑a ≬ U).
-
-notation "↓a" with precedence 80 for @{ 'downarrow $a }.
+definition downarrow ≝ λA:axiom_set.λU:Ω \sup A.mk_powerset ? (λa:A. (↑a) ≬ U).
interpretation "downarrow" 'downarrow a = (downarrow _ a).
-definition fintersects ≝ λA:axiom_set.λU,V:2 \sup A.↓U ∩ ↓V.
-
-notation "hvbox(U break ↓ V)" non associative with precedence 80 for @{ 'fintersects $U $V }.
+definition fintersects ≝ λA:axiom_set.λU,V:Ω \sup A.↓U ∩ ↓V.
interpretation "fintersects" 'fintersects U V = (fintersects _ U V).
record convergent_generated_topology : Type ≝
{ AA:> axiom_set;
- convergence: ∀a:AA.∀U,V:2 \sup AA. a ◃ U → a ◃ V → a ◃ U ↓ V
+ convergence: ∀a:AA.∀U,V:Ω \sup AA. a ◃ U → a ◃ V → a ◃ (U ↓ V)
}.
-
projects / helm.git / blobdiff