Step
*
1
3
1
1
1
1
of Lemma
fset-ac-le-distributive-constrained
1. T : Type
2. eq : EqDecider(T)
3. P : fset(T) ⟶ 𝔹
4. ∀x,y:fset(T). (y ⊆ x ⇒ (↑(P x)) ⇒ (↑(P y)))
5. a : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
6. b : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
7. c : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
8. fset-ac-le(eq;glb(P;a;c);glb(P;a;lub(P;b;c)))
9. x : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
10. ∀a1:fset(T). (a1 ∈ glb(P;a;b) ⇒ (¬({y ∈ x | deq-f-subset(eq) y a1} = {} ∈ fset(fset(T)))))
11. ∀a1:fset(T). (a1 ∈ glb(P;a;c) ⇒ (¬({y ∈ x | deq-f-subset(eq) y a1} = {} ∈ fset(fset(T)))))
12. xx : fset(T)
13. as : fset(T)
14. as ∈ a
15. x1 : fset(T)
16. x1 ∈ lub(P;b;c)
17. xx = as ⋃ x1 ∈ fset(T)
18. ↑(P xx)
19. ∀[ys:fset(T)]
↑¬bf-proper-subset-dec(eq;ys;xx)
supposing ys ∈ f-union(deq-fset(eq);deq-fset(eq);a;as.λbs.as ⋃ bs"(lub(P;b;c)) s.t. P)
20. {y ∈ x | deq-f-subset(eq) y xx} = {} ∈ fset(fset(T))
21. ∀[ys:fset(T)]. ¬ys ⋃ x1 ⊆≠ xx supposing ys ∈ a ∧ (↑(P ys ⋃ x1))
⊢ False
BY
{ (DupHyp (-6)
THEN RepUR ``fset-constrained-ac-lub fset-ac-lub`` (-1)⋅
THEN (RWO "member-fset-minimals" (-1) THENA Auto)
THEN D -1
THEN (RWO "member-fset-union" (-2) THENA Auto)
THEN (D -2 THENL [RenameVar `bs' (-8); (RenameVar `bs' (-8) THEN SwapVars `b' `c')])
THEN (Assert ∀[ys:fset(T)]. ¬ys ⊆≠ x1 supposing ys ∈ b ⋃ c BY
((InstLemma `fset-all-iff` [⌜fset(T)⌝;⌜deq-fset(eq)⌝]⋅ THENA Auto)
THEN (RWO "-1" (-2) THENA Auto)
THEN Thin (-1)
THEN RepeatFor 2 (ParallelLast)
THEN RW assert_pushdownC (-1)
THEN Auto))
THEN Thin (-2)
THEN (Assert ¬xx ∈ glb(P;a;b) BY
(D 0 THEN Auto))) }
1
1. T : Type
2. eq : EqDecider(T)
3. P : fset(T) ⟶ 𝔹
4. ∀x,y:fset(T). (y ⊆ x ⇒ (↑(P x)) ⇒ (↑(P y)))
5. a : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
6. b : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
7. c : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
8. fset-ac-le(eq;glb(P;a;c);glb(P;a;lub(P;b;c)))
9. x : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
10. ∀a1:fset(T). (a1 ∈ glb(P;a;b) ⇒ (¬({y ∈ x | deq-f-subset(eq) y a1} = {} ∈ fset(fset(T)))))
11. ∀a1:fset(T). (a1 ∈ glb(P;a;c) ⇒ (¬({y ∈ x | deq-f-subset(eq) y a1} = {} ∈ fset(fset(T)))))
12. xx : fset(T)
13. as : fset(T)
14. as ∈ a
15. x1 : fset(T)
16. bs : x1 ∈ lub(P;b;c)
17. xx = as ⋃ x1 ∈ fset(T)
18. ↑(P xx)
19. ∀[ys:fset(T)]
↑¬bf-proper-subset-dec(eq;ys;xx)
supposing ys ∈ f-union(deq-fset(eq);deq-fset(eq);a;as.λbs.as ⋃ bs"(lub(P;b;c)) s.t. P)
20. {y ∈ x | deq-f-subset(eq) y xx} = {} ∈ fset(fset(T))
21. ∀[ys:fset(T)]. ¬ys ⋃ x1 ⊆≠ xx supposing ys ∈ a ∧ (↑(P ys ⋃ x1))
22. x1 ∈ b
23. ∀[ys:fset(T)]. ¬ys ⊆≠ x1 supposing ys ∈ b ⋃ c
24. ¬xx ∈ glb(P;a;b)
⊢ False
2
1. T : Type
2. eq : EqDecider(T)
3. P : fset(T) ⟶ 𝔹
4. ∀x,y:fset(T). (y ⊆ x ⇒ (↑(P x)) ⇒ (↑(P y)))
5. a : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
6. c : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
7. b : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
8. fset-ac-le(eq;glb(P;a;b);glb(P;a;lub(P;c;b)))
9. x : {ac:fset(fset(T))| (↑fset-antichain(eq;ac)) ∧ fset-all(ac;a.P[a])}
10. ∀a1:fset(T). (a1 ∈ glb(P;a;c) ⇒ (¬({y ∈ x | deq-f-subset(eq) y a1} = {} ∈ fset(fset(T)))))
11. ∀a1:fset(T). (a1 ∈ glb(P;a;b) ⇒ (¬({y ∈ x | deq-f-subset(eq) y a1} = {} ∈ fset(fset(T)))))
12. xx : fset(T)
13. as : fset(T)
14. as ∈ a
15. x1 : fset(T)
16. bs : x1 ∈ lub(P;c;b)
17. xx = as ⋃ x1 ∈ fset(T)
18. ↑(P xx)
19. ∀[ys:fset(T)]
↑¬bf-proper-subset-dec(eq;ys;xx)
supposing ys ∈ f-union(deq-fset(eq);deq-fset(eq);a;as.λbs.as ⋃ bs"(lub(P;c;b)) s.t. P)
20. {y ∈ x | deq-f-subset(eq) y xx} = {} ∈ fset(fset(T))
21. ∀[ys:fset(T)]. ¬ys ⋃ x1 ⊆≠ xx supposing ys ∈ a ∧ (↑(P ys ⋃ x1))
22. x1 ∈ b
23. ∀[ys:fset(T)]. ¬ys ⊆≠ x1 supposing ys ∈ b ⋃ c
24. ¬xx ∈ glb(P;a;b)
⊢ False
Latex:
Latex:
1. T : Type
2. eq : EqDecider(T)
3. P : fset(T) {}\mrightarrow{} \mBbbB{}
4. \mforall{}x,y:fset(T). (y \msubseteq{} x {}\mRightarrow{} (\muparrow{}(P x)) {}\mRightarrow{} (\muparrow{}(P y)))
5. a : \{ac:fset(fset(T))| (\muparrow{}fset-antichain(eq;ac)) \mwedge{} fset-all(ac;a.P[a])\}
6. b : \{ac:fset(fset(T))| (\muparrow{}fset-antichain(eq;ac)) \mwedge{} fset-all(ac;a.P[a])\}
7. c : \{ac:fset(fset(T))| (\muparrow{}fset-antichain(eq;ac)) \mwedge{} fset-all(ac;a.P[a])\}
8. fset-ac-le(eq;glb(P;a;c);glb(P;a;lub(P;b;c)))
9. x : \{ac:fset(fset(T))| (\muparrow{}fset-antichain(eq;ac)) \mwedge{} fset-all(ac;a.P[a])\}
10. \mforall{}a1:fset(T). (a1 \mmember{} glb(P;a;b) {}\mRightarrow{} (\mneg{}(\{y \mmember{} x | deq-f-subset(eq) y a1\} = \{\})))
11. \mforall{}a1:fset(T). (a1 \mmember{} glb(P;a;c) {}\mRightarrow{} (\mneg{}(\{y \mmember{} x | deq-f-subset(eq) y a1\} = \{\})))
12. xx : fset(T)
13. as : fset(T)
14. as \mmember{} a
15. x1 : fset(T)
16. x1 \mmember{} lub(P;b;c)
17. xx = as \mcup{} x1
18. \muparrow{}(P xx)
19. \mforall{}[ys:fset(T)]
\muparrow{}\mneg{}\msubb{}f-proper-subset-dec(eq;ys;xx)
supposing ys \mmember{} f-union(deq-fset(eq);deq-fset(eq);a;as.\mlambda{}bs.as \mcup{} bs"(lub(P;b;c)) s.t. P)
20. \{y \mmember{} x | deq-f-subset(eq) y xx\} = \{\}
21. \mforall{}[ys:fset(T)]. \mneg{}ys \mcup{} x1 \msubseteq{}\mneq{} xx supposing ys \mmember{} a \mwedge{} (\muparrow{}(P ys \mcup{} x1))
\mvdash{} False
By
Latex:
(DupHyp (-6)
THEN RepUR ``fset-constrained-ac-lub fset-ac-lub`` (-1)\mcdot{}
THEN (RWO "member-fset-minimals" (-1) THENA Auto)
THEN D -1
THEN (RWO "member-fset-union" (-2) THENA Auto)
THEN (D -2 THENL [RenameVar `bs' (-8); (RenameVar `bs' (-8) THEN SwapVars `b' `c')])
THEN (Assert \mforall{}[ys:fset(T)]. \mneg{}ys \msubseteq{}\mneq{} x1 supposing ys \mmember{} b \mcup{} c BY
((InstLemma `fset-all-iff` [\mkleeneopen{}fset(T)\mkleeneclose{};\mkleeneopen{}deq-fset(eq)\mkleeneclose{}]\mcdot{} THENA Auto)
THEN (RWO "-1" (-2) THENA Auto)
THEN Thin (-1)
THEN RepeatFor 2 (ParallelLast)
THEN RW assert\_pushdownC (-1)
THEN Auto))
THEN Thin (-2)
THEN (Assert \mneg{}xx \mmember{} glb(P;a;b) BY
(D 0 THEN Auto)))
Home
Index