OAI/Combinatorics/UniformKServer/TreeLeaves.lean
10 declarations, 0 contain sorry, 0 declared as axioms
Unique child on a leaf path and conservation of literal hidden counts.
- def
OAI.UniformKServer.TreeLeaves.leafline 16 - theorem
OAI.UniformKServer.TreeLeaves.root_descendsline 18 - theorem
OAI.UniformKServer.TreeLeaves.child_pathline 25 - def
OAI.UniformKServer.TreeLeaves.indicatorline 36 - theorem
OAI.UniformKServer.TreeLeaves.indicator_rootline 38 - theorem
OAI.UniformKServer.TreeLeaves.indicator_childrenline 40 - def
OAI.UniformKServer.TreeLeaves.countline 56 - theorem
OAI.UniformKServer.TreeLeaves.count_leline 58 - theorem
OAI.UniformKServer.TreeLeaves.count_rootline 63 - theorem
OAI.UniformKServer.TreeLeaves.count_childrenline 66