1 include "sets/sets.ma".
3 nrecord axiom_set : Type[1] ≝ {
9 ndefinition cover_set ≝ λc:∀A:axiom_set.Ω^A → A → CProp[0].λA,C,U.
13 notation "hvbox(a break ◃ b)" non associative with precedence 45
14 for @{ 'covers $a $b }.
16 interpretation "covers set temp" 'covers C U = (cover_set ?? C U).
18 ninductive cover (A : axiom_set) (U : Ω^A) : A → CProp[0] ≝
19 | creflexivity : ∀a:A. a ∈ U → cover ? U a
20 | cinfinity : ∀a:A. ∀i:I ? a. (C ? a i ◃ U) → cover ? U a.
24 interpretation "covers" 'covers a U = (cover ? U a).
25 interpretation "covers set" 'covers a U = (cover_set cover ? a U).
27 ndefinition fish_set ≝ λf:∀A:axiom_set.Ω^A → A → CProp[0].
32 notation "hvbox(a break ⋉ b)" non associative with precedence 45
35 interpretation "fish set temp" 'fish A U = (fish_set ?? U A).
37 ncoinductive fish (A : axiom_set) (F : Ω^A) : A → CProp[0] ≝
38 | cfish : ∀a. a ∈ F → (∀i:I ? a.C A a i ⋉ F) → fish A F a.
42 interpretation "fish set" 'fish A U = (fish_set fish ? U A).
43 interpretation "fish" 'fish a U = (fish ? U a).
45 nlet corec fish_rec (A:axiom_set) (U: Ω^A)
47 (H2: ∀a:A. a ∈ P → ∀j: I ? a. C ? a j ≬ P):
48 ∀a:A. ∀p: a ∈ P. a ⋉ U ≝ ?.
50 ##[ napply H1; napply p;
51 ##| #i; ncases (H2 a p i); #x; *; #xC; #xP; @; ##[napply x]
52 @; ##[ napply xC ] napply (fish_rec ? U P); nassumption;
57 alias symbol "covers" (instance 0) = "covers".
58 alias symbol "covers" (instance 2) = "covers".
59 alias symbol "covers" (instance 1) = "covers set".
60 ntheorem covers_elim2:
61 ∀A: axiom_set. ∀U:Ω^A.∀P: A → CProp[0].
63 (∀a:A.∀V:Ω^A. a ◃ V → V ◃ U → (∀y. y ∈ V → P y) → P a) →
65 #A; #U; #P; #H1; #H2; #a; #aU; nelim aU;
66 ##[ #b; #H; napply H1; napply H;
67 ##| #b; #i; #CaiU; #H; napply H2;
69 ##| napply cinfinity; ##[ napply i ] nwhd; #y; #H3; napply creflexivity; ##]
75 alias symbol "fish" (instance 1) = "fish set".
76 alias symbol "covers" = "covers".
77 ntheorem compatibility: ∀A:axiom_set.∀a:A.∀U,V. a ⋉ V → a ◃ U → U ⋉ V.
78 #A; #a; #U; #V; #aV; #aU; ngeneralize in match aV; (* clear aV *)
80 ##[ #b; #bU; #bV; @; ##[ napply b] @; nassumption;
81 ##| #b; #i; #CaiU; #H; #bV; ncases bV in i CaiU H;
82 #c; #cV; #CciV; #i; #CciU; #H; ncases (CciV i); #x; *; #xCci; #xV;
83 napply H; nassumption;
89 definition leq ≝ λA:axiom_set.λa,b:A. a ◃ {y|b=y}.
91 interpretation "covered by one" 'leq a b = (leq ? a b).
93 theorem leq_refl: ∀A:axiom_set.∀a:A. a ≤ a.
100 theorem leq_trans: ∀A:axiom_set.∀a,b,c:A. a ≤ b → b ≤ c → a ≤ c.
103 apply (transitivity ???? H);
111 definition uparrow ≝ λA:axiom_set.λa:A.mk_powerset ? (λb:A. a ≤ b).
113 interpretation "uparrow" 'uparrow a = (uparrow ? a).
115 definition downarrow ≝ λA:axiom_set.λU:Ω \sup A.mk_powerset ? (λa:A. (↑a) ≬ U).
117 interpretation "downarrow" 'downarrow a = (downarrow ? a).
119 definition fintersects ≝ λA:axiom_set.λU,V:Ω \sup A.↓U ∩ ↓V.
121 interpretation "fintersects" 'fintersects U V = (fintersects ? U V).
123 record convergent_generated_topology : Type ≝
125 convergence: ∀a:AA.∀U,V:Ω \sup AA. a ◃ U → a ◃ V → a ◃ (U ↓ V)