Theorem usgrnloopv

Description: In a simple graph, there is no loop, i.e. no edge connecting a vertex with itself. (Contributed by Alexander van der Vekens, 26-Jan-2018) (Revised by AV, 17-Oct-2020) (Proof shortened by AV, 11-Dec-2020)

	Ref	Expression
Hypothesis	usgrnloopv.e	$$⊢E=\mathrm{iEdg}\left(G\right)$$
Assertion	usgrnloopv	$$⊢\left(G\in \mathrm{USGraph}\wedge M\in W\right)\to \left(E\left(X\right)=\left\{M,N\right\}\to M\ne N\right)$$

Proof

Step	Hyp	Ref	Expression
1		usgrnloopv.e	$$⊢E=\mathrm{iEdg}\left(G\right)$$
2		usgrumgr	$$⊢G\in \mathrm{USGraph}\to G\in \mathrm{UMGraph}$$
3	1	umgrnloopv	$$⊢\left(G\in \mathrm{UMGraph}\wedge M\in W\right)\to \left(E\left(X\right)=\left\{M,N\right\}\to M\ne N\right)$$
4	2 3	sylan	$$⊢\left(G\in \mathrm{USGraph}\wedge M\in W\right)\to \left(E\left(X\right)=\left\{M,N\right\}\to M\ne N\right)$$