equation 3.47 eq:set-double-inclusion
open in the book ·
parts/02-mathematical-methods/01-logic-sets.tex:1023
- connected by a declared semantic edge
Rests on
No declared or derived dependency edges point away from this node yet.
Supports
- depends_on proposition 3.54 Preimages respect the set operations ¶
- depends_on proposition 3.37 De Morgan's laws for sets ¶
-
depends_on
theorem 3.60
Equivalence classes partition the set
¶
-
depends_on
lemma A.10
lem:app-comp-welldefined
¶
-
depends_on
lemma A.11
Truth lemma
¶
-
depends_on
theorem A.12
Model existence
¶
- depends_on corollary A.14 Compactness ¶
- depends_on theorem A.13 Completeness ¶
-
depends_on
theorem A.12
Model existence
¶
-
depends_on
lemma A.11
Truth lemma
¶
-
depends_on
lemma A.10
lem:app-comp-welldefined
¶
Neighborhood
Every logical edge within two steps of this node.
- declared and complete
- partly declared
- a check failed
- not graded
- declared in the source
- inferred from structure
Edges
| type | direction | node | provenance | where |
|---|---|---|---|---|
depends_on |
← | Preimages respect the set operations | declared | parts/02-mathematical-methods/01-logic-sets.tex:1371 |
depends_on |
← | De Morgan's laws for sets | declared | parts/02-mathematical-methods/01-logic-sets.tex:1040 |
depends_on |
← | Equivalence classes partition the set | declared | parts/02-mathematical-methods/01-logic-sets.tex:1563 |