Description: Properties of an ordered pair with a finite first component with at least L elements, proven by finite induction on the size of the first component. This theorem can be applied for graphs (represented as orderd pairs of vertices and edges) with a finite number of vertices, usually with L = 0 (see opfi1ind ) or L = 1 . (Contributed by AV, 22-Oct-2020) (Revised by AV, 28-Mar-2021)
Ref | Expression | ||
---|---|---|---|
Hypotheses | fi1uzind.f | |
|
fi1uzind.l | |
||
fi1uzind.1 | |
||
fi1uzind.2 | |
||
fi1uzind.3 | |
||
fi1uzind.4 | |
||
fi1uzind.base | |
||
fi1uzind.step | |
||
Assertion | fi1uzind | |