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;