File tree Expand file tree Collapse file tree 2 files changed +8
-9
lines changed
Expand file tree Collapse file tree 2 files changed +8
-9
lines changed Original file line number Diff line number Diff line change @@ -3,13 +3,12 @@ import lib/foundations/univalent/path
33
44--- AFH, ABCFHL
55
6- def coe0→1 (A : I → U) (a : A 0) : A 1 := transp (<i> A i) 0 a
6+ def coei→0 (A : I → U) (i : I) (a : A i) : A 0 := transp (<j> A (i ∧ -j)) (-i) a
7+ def coe1→i (A : I → U) (i : I) (a : A 1) : A i := transp (<j> A (i ∨ -j)) i a
78def coe0→i (A : I → U) (r : I) (a : A 0) : A r := transp (<j> A (r ∧ j)) (-r) a
8- def coe0→i1 (A : I → U) (a : A 0) : Path (A 1) (coe0→i A 1 a) (coe0→1 A a) := <_> (coe0→1 A a)
9+ def coe0→1 (A : I → U) (a : A 0) : A 1 := transp (<i> A i) 0 a
10+ def coe1→0 (A : I → U) (a : A 1) : A 0 := transp (<i> A (-i)) 0 a
911def coe0→i0 (A : I → U) (a : A 0) : Path (A 0) (coe0→i A 0 a) a := <_> a
10- def coe1→0 (A : I → U) (a: A 1) : A 0 := transp (<i> A (-i)) 0 a
11- def coe1→i (A : I → U) (i : I) (a : A 1) : A i := transp (<j> A (i ∨ -j)) i a
12- def coei→0 (A : I → U) (i : I) (a : A i) : A 0 := transp (<j> A (i ∧ -j)) (-i) a
1312def coei0→0 (A : I → U) (a : A 0) : Path (A 0) (coei→0 A 0 a) a := <_> a
1413def coei1→0 (A : I → U) (a : A 1) : Path (A 0) (coei→0 A 1 a) (coe1→0 A a) := <_> (coe1→0 A a)
15-
14+ def coe0→i1 (A : I → U) (a : A 0) : Path (A 1) (coe0→i A 1 a) (coe0→1 A a) := <_> (coe0→1 A a)
Original file line number Diff line number Diff line change @@ -35,6 +35,6 @@ def total (X: U₁) : ℙ X := \ (_: X) (_: U), true
3535def ∈ (X: U₁) (el: X) (set: ℙ X) : U₁ := Path₁ (U → 𝟐) (set el) (\(_: U), true)
3636def ∉ (X: U₁) (el: X) (set: ℙ X) : U₁ := Path₁ (U → 𝟐) (set el) (\(_: U), false)
3737def ⊆ (X: U₁) (A B: ℙ X) := Π (x: X), (∈ X x A) × (∈ X x B)
38- def ∁ (X: U₁) : ℙ X → ℙ X := λ (h: ℙ X), λ (x: X) (Y: U), not (h x Y)
39- def ∪ (X: U₁) : ℙ X → ℙ X → ℙ X := λ (h1: ℙ X) (h2: ℙ X), λ (x: X) (Y: U), or (h1 x Y) (h2 x Y)
40- def ∩ (X: U₁) : ℙ X → ℙ X → ℙ X := λ (h1: ℙ X) (h2: ℙ X), λ (x: X) (Y: U), and (h1 x Y) (h2 x Y)
38+ def ∁ (X: U₁) : ℙ X → ℙ X := λ (h : ℙ X), λ (x: X) (Y: U), not (h x Y)
39+ def ∪ (X: U₁) : ℙ X → ℙ X → ℙ X := λ (h1 : ℙ X) (h2: ℙ X), λ (x: X) (Y: U), or (h1 x Y) (h2 x Y)
40+ def ∩ (X: U₁) : ℙ X → ℙ X → ℙ X := λ (h1 : ℙ X) (h2: ℙ X), λ (x: X) (Y: U), and (h1 x Y) (h2 x Y)
You can’t perform that action at this time.
0 commit comments