Description: Any two distinct vertices in a complete simple graph are connected to each other by an edge. (Contributed by BTernaryTau, 4-Oct-2023)
Ref | Expression | ||
---|---|---|---|
Hypotheses | cusgredgex2.1 | |
|
cusgredgex2.2 | |
||
Assertion | cusgredgex2 | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cusgredgex2.1 | |
|
2 | cusgredgex2.2 | |
|
3 | eldifsn | |
|
4 | necom | |
|
5 | 4 | anbi2i | |
6 | 3 5 | sylbbr | |
7 | 6 | anim2i | |
8 | 7 | 3impb | |
9 | 1 2 | cusgredgex | |
10 | 8 9 | syl5 | |