Metamath Proof Explorer

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 = iEdg (G)$
	Assertion	usgrnloopv	$⊢ (G \in USGraph \land M \in W) \to (E (X) = \{M, N\} \to M \neq N)$

Proof

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