usgr2pthlem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > usgr2pthlem		Structured version Visualization version GIF version

Theorem usgr2pthlem 29848

Description: Lemma for usgr2pth 29849. (Contributed by Alexander van der Vekens, 27-Jan-2018.) (Revised by AV, 5-Jun-2021.)

**Hypotheses**
Ref	Expression
usgr2pthlem.v	⊢ 𝑉 = (Vtx‘𝐺)
usgr2pthlem.i	⊢ 𝐼 = (iEdg‘𝐺)

**Assertion**
Ref	Expression
usgr2pthlem	⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))}) → ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))

Distinct variable groups: 𝑖,𝐹 𝑥,𝐹,𝑦,𝑧 𝑥,𝐺,𝑦,𝑧 𝑖,𝐼 𝑥,𝐼,𝑦,𝑧 𝑃,𝑖 𝑥,𝑃,𝑦,𝑧 𝑥,𝑉,𝑦,𝑧 Allowed substitution hints: 𝐺(𝑖) 𝑉(𝑖)

**Proof of Theorem usgr2pthlem**
Step	Hyp	Ref	Expression
1		0nn0 12428	. . . . . . . . . . . . . 14 ⊢ 0 ∈ ℕ₀
2		2nn0 12430	. . . . . . . . . . . . . 14 ⊢ 2 ∈ ℕ₀
3		0le2 12259	. . . . . . . . . . . . . 14 ⊢ 0 ≤ 2
4		elfz2nn0 13546	. . . . . . . . . . . . . 14 ⊢ (0 ∈ (0...2) ↔ (0 ∈ ℕ₀ ∧ 2 ∈ ℕ₀ ∧ 0 ≤ 2))
5	1, 2, 3, 4	mpbir3an 1343	. . . . . . . . . . . . 13 ⊢ 0 ∈ (0...2)
6		ffvelcdm 7035	. . . . . . . . . . . . 13 ⊢ ((𝑃:(0...2)⟶𝑉 ∧ 0 ∈ (0...2)) → (𝑃‘0) ∈ 𝑉)
7	5, 6	mpan2 692	. . . . . . . . . . . 12 ⊢ (𝑃:(0...2)⟶𝑉 → (𝑃‘0) ∈ 𝑉)
8	7	adantl 481	. . . . . . . . . . 11 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘0) ∈ 𝑉)
9		1nn0 12429	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℕ₀
10		1le2 12361	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ≤ 2
11		elfz2nn0 13546	. . . . . . . . . . . . . . . . . 18 ⊢ (1 ∈ (0...2) ↔ (1 ∈ ℕ₀ ∧ 2 ∈ ℕ₀ ∧ 1 ≤ 2))
12	9, 2, 10, 11	mpbir3an 1343	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ (0...2)
13		ffvelcdm 7035	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃:(0...2)⟶𝑉 ∧ 1 ∈ (0...2)) → (𝑃‘1) ∈ 𝑉)
14	12, 13	mpan2 692	. . . . . . . . . . . . . . . 16 ⊢ (𝑃:(0...2)⟶𝑉 → (𝑃‘1) ∈ 𝑉)
15	14	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘1) ∈ 𝑉)
16		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → 𝐺 ∈ USGraph)
17		fvex 6855	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃‘1) ∈ V
18	16, 17	jctir 520	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝐺 ∈ USGraph ∧ (𝑃‘1) ∈ V))
19		prcom 4691	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ {(𝑃‘0), (𝑃‘1)} = {(𝑃‘1), (𝑃‘0)}
20	19	eqeq2i 2750	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ↔ (𝐼‘(𝐹‘0)) = {(𝑃‘1), (𝑃‘0)})
21	20	biimpi 216	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} → (𝐼‘(𝐹‘0)) = {(𝑃‘1), (𝑃‘0)})
22	21	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝐼‘(𝐹‘0)) = {(𝑃‘1), (𝑃‘0)})
23	22	ad2antlr 728	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝐼‘(𝐹‘0)) = {(𝑃‘1), (𝑃‘0)})
24		usgr2pthlem.i	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐼 = (iEdg‘𝐺)
25	24	usgrnloopv 29285	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ USGraph ∧ (𝑃‘1) ∈ V) → ((𝐼‘(𝐹‘0)) = {(𝑃‘1), (𝑃‘0)} → (𝑃‘1) ≠ (𝑃‘0)))
26	18, 23, 25	sylc 65	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝑃‘1) ≠ (𝑃‘0))
27	26	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘1) ≠ (𝑃‘0))
28	17	elsn 4597	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃‘1) ∈ {(𝑃‘0)} ↔ (𝑃‘1) = (𝑃‘0))
29	28	necon3bbii 2980	. . . . . . . . . . . . . . . 16 ⊢ (¬ (𝑃‘1) ∈ {(𝑃‘0)} ↔ (𝑃‘1) ≠ (𝑃‘0))
30	27, 29	sylibr 234	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ¬ (𝑃‘1) ∈ {(𝑃‘0)})
31	15, 30	eldifd 3914	. . . . . . . . . . . . . 14 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘1) ∈ (𝑉 ∖ {(𝑃‘0)}))
32	31	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) → (𝑃‘1) ∈ (𝑉 ∖ {(𝑃‘0)}))
33		sneq 4592	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝑃‘0) → {𝑥} = {(𝑃‘0)})
34	33	difeq2d 4080	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑃‘0) → (𝑉 ∖ {𝑥}) = (𝑉 ∖ {(𝑃‘0)}))
35	34	eleq2d 2823	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑃‘0) → ((𝑃‘1) ∈ (𝑉 ∖ {𝑥}) ↔ (𝑃‘1) ∈ (𝑉 ∖ {(𝑃‘0)})))
36	35	adantl 481	. . . . . . . . . . . . 13 ⊢ (((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) → ((𝑃‘1) ∈ (𝑉 ∖ {𝑥}) ↔ (𝑃‘1) ∈ (𝑉 ∖ {(𝑃‘0)})))
37	32, 36	mpbird 257	. . . . . . . . . . . 12 ⊢ (((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) → (𝑃‘1) ∈ (𝑉 ∖ {𝑥}))
38		2re 12231	. . . . . . . . . . . . . . . . . . . 20 ⊢ 2 ∈ ℝ
39	38	leidi 11683	. . . . . . . . . . . . . . . . . . 19 ⊢ 2 ≤ 2
40		elfz2nn0 13546	. . . . . . . . . . . . . . . . . . 19 ⊢ (2 ∈ (0...2) ↔ (2 ∈ ℕ₀ ∧ 2 ∈ ℕ₀ ∧ 2 ≤ 2))
41	2, 2, 39, 40	mpbir3an 1343	. . . . . . . . . . . . . . . . . 18 ⊢ 2 ∈ (0...2)
42		ffvelcdm 7035	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑃:(0...2)⟶𝑉 ∧ 2 ∈ (0...2)) → (𝑃‘2) ∈ 𝑉)
43	41, 42	mpan2 692	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃:(0...2)⟶𝑉 → (𝑃‘2) ∈ 𝑉)
44	43	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘2) ∈ 𝑉)
45	24	usgrf1 29257	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1→ran 𝐼)
46	45	ad2antlr 728	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → 𝐼:dom 𝐼–1-1→ran 𝐼)
47		simpl 482	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → 𝐹:(0..^2)–1-1→dom 𝐼)
48	47	ad2antrr 727	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → 𝐹:(0..^2)–1-1→dom 𝐼)
49	46, 48	jca 511	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝐼:dom 𝐼–1-1→ran 𝐼 ∧ 𝐹:(0..^2)–1-1→dom 𝐼))
50		2nn 12230	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ 2 ∈ ℕ
51		lbfzo0 13627	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (0 ∈ (0..^2) ↔ 2 ∈ ℕ)
52	50, 51	mpbir 231	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 0 ∈ (0..^2)
53		1lt2 12323	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ 1 < 2
54		elfzo0 13628	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (1 ∈ (0..^2) ↔ (1 ∈ ℕ₀ ∧ 2 ∈ ℕ ∧ 1 < 2))
55	9, 50, 53, 54	mpbir3an 1343	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 1 ∈ (0..^2)
56	52, 55	pm3.2i 470	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (0 ∈ (0..^2) ∧ 1 ∈ (0..^2))
57	56	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (0 ∈ (0..^2) ∧ 1 ∈ (0..^2)))
58		0ne1 12228	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 ≠ 1
59	58	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → 0 ≠ 1)
60	49, 57, 59	3jca 1129	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ((𝐼:dom 𝐼–1-1→ran 𝐼 ∧ 𝐹:(0..^2)–1-1→dom 𝐼) ∧ (0 ∈ (0..^2) ∧ 1 ∈ (0..^2)) ∧ 0 ≠ 1))
61		simpr 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
62	61	ad2antrr 727	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
63		2f1fvneq 7216	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐼:dom 𝐼–1-1→ran 𝐼 ∧ 𝐹:(0..^2)–1-1→dom 𝐼) ∧ (0 ∈ (0..^2) ∧ 1 ∈ (0..^2)) ∧ 0 ≠ 1) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → {(𝑃‘0), (𝑃‘1)} ≠ {(𝑃‘1), (𝑃‘2)}))
64	60, 62, 63	sylc 65	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → {(𝑃‘0), (𝑃‘1)} ≠ {(𝑃‘1), (𝑃‘2)})
65		necom 2986	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑃‘2) ≠ (𝑃‘0) ↔ (𝑃‘0) ≠ (𝑃‘2))
66		fvex 6855	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑃‘0) ∈ V
67		fvex 6855	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑃‘2) ∈ V
68	66, 17, 67	3pm3.2i 1341	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑃‘0) ∈ V ∧ (𝑃‘1) ∈ V ∧ (𝑃‘2) ∈ V)
69		fvexd 6857	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝑃‘0) ∈ V)
70		simpl 482	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)})
71	70	ad2antlr 728	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)})
72	16, 69, 71	jca31 514	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → ((𝐺 ∈ USGraph ∧ (𝑃‘0) ∈ V) ∧ (𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)}))
73	72	adantr 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ((𝐺 ∈ USGraph ∧ (𝑃‘0) ∈ V) ∧ (𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)}))
74	24	usgrnloopv 29285	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐺 ∈ USGraph ∧ (𝑃‘0) ∈ V) → ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} → (𝑃‘0) ≠ (𝑃‘1)))
75	74	imp 406	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐺 ∈ USGraph ∧ (𝑃‘0) ∈ V) ∧ (𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)}) → (𝑃‘0) ≠ (𝑃‘1))
76	73, 75	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘0) ≠ (𝑃‘1))
77		pr1nebg 4816	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑃‘0) ∈ V ∧ (𝑃‘1) ∈ V ∧ (𝑃‘2) ∈ V) ∧ (𝑃‘0) ≠ (𝑃‘1)) → ((𝑃‘0) ≠ (𝑃‘2) ↔ {(𝑃‘0), (𝑃‘1)} ≠ {(𝑃‘1), (𝑃‘2)}))
78	68, 76, 77	sylancr 588	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ((𝑃‘0) ≠ (𝑃‘2) ↔ {(𝑃‘0), (𝑃‘1)} ≠ {(𝑃‘1), (𝑃‘2)}))
79	65, 78	bitrid 283	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ((𝑃‘2) ≠ (𝑃‘0) ↔ {(𝑃‘0), (𝑃‘1)} ≠ {(𝑃‘1), (𝑃‘2)}))
80	64, 79	mpbird 257	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘2) ≠ (𝑃‘0))
81		fvexd 6857	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝑃‘2) ∈ V)
82		prcom 4691	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ {(𝑃‘1), (𝑃‘2)} = {(𝑃‘2), (𝑃‘1)}
83	82	eqeq2i 2750	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)} ↔ (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)})
84	83	biimpi 216	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)} → (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)})
85	84	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)})
86	85	ad2antlr 728	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)})
87	16, 81, 86	jca31 514	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) → ((𝐺 ∈ USGraph ∧ (𝑃‘2) ∈ V) ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)}))
88	87	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ((𝐺 ∈ USGraph ∧ (𝑃‘2) ∈ V) ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)}))
89	24	usgrnloopv 29285	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ USGraph ∧ (𝑃‘2) ∈ V) → ((𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)} → (𝑃‘2) ≠ (𝑃‘1)))
90	89	imp 406	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺 ∈ USGraph ∧ (𝑃‘2) ∈ V) ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘2), (𝑃‘1)}) → (𝑃‘2) ≠ (𝑃‘1))
91	88, 90	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘2) ≠ (𝑃‘1))
92	80, 91	nelprd 4616	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → ¬ (𝑃‘2) ∈ {(𝑃‘0), (𝑃‘1)})
93	44, 92	eldifd 3914	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (𝑃‘2) ∈ (𝑉 ∖ {(𝑃‘0), (𝑃‘1)}))
94	93	ad2antrr 727	. . . . . . . . . . . . . 14 ⊢ ((((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) ∧ 𝑦 = (𝑃‘1)) → (𝑃‘2) ∈ (𝑉 ∖ {(𝑃‘0), (𝑃‘1)}))
95		preq12 4694	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) → {𝑥, 𝑦} = {(𝑃‘0), (𝑃‘1)})
96	95	difeq2d 4080	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) → (𝑉 ∖ {𝑥, 𝑦}) = (𝑉 ∖ {(𝑃‘0), (𝑃‘1)}))
97	96	eleq2d 2823	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) → ((𝑃‘2) ∈ (𝑉 ∖ {𝑥, 𝑦}) ↔ (𝑃‘2) ∈ (𝑉 ∖ {(𝑃‘0), (𝑃‘1)})))
98	97	adantll 715	. . . . . . . . . . . . . 14 ⊢ ((((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) ∧ 𝑦 = (𝑃‘1)) → ((𝑃‘2) ∈ (𝑉 ∖ {𝑥, 𝑦}) ↔ (𝑃‘2) ∈ (𝑉 ∖ {(𝑃‘0), (𝑃‘1)})))
99	94, 98	mpbird 257	. . . . . . . . . . . . 13 ⊢ ((((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) ∧ 𝑦 = (𝑃‘1)) → (𝑃‘2) ∈ (𝑉 ∖ {𝑥, 𝑦}))
100		eqcom 2744	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = (𝑃‘0) ↔ (𝑃‘0) = 𝑥)
101		eqcom 2744	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = (𝑃‘1) ↔ (𝑃‘1) = 𝑦)
102		eqcom 2744	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑃‘2) ↔ (𝑃‘2) = 𝑧)
103	100, 101, 102	3anbi123i 1156	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1) ∧ 𝑧 = (𝑃‘2)) ↔ ((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧))
104	103	biimpi 216	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1) ∧ 𝑧 = (𝑃‘2)) → ((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧))
105	104	ad4ant123 1174	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → ((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧))
106	100	biimpi 216	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 = (𝑃‘0) → (𝑃‘0) = 𝑥)
107	106	ad2antrr 727	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → (𝑃‘0) = 𝑥)
108	101	biimpi 216	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 = (𝑃‘1) → (𝑃‘1) = 𝑦)
109	108	ad2antlr 728	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → (𝑃‘1) = 𝑦)
110	107, 109	preq12d 4700	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → {(𝑃‘0), (𝑃‘1)} = {𝑥, 𝑦})
111	110	eqeq2d 2748	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ↔ (𝐼‘(𝐹‘0)) = {𝑥, 𝑦}))
112	102	biimpi 216	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑧 = (𝑃‘2) → (𝑃‘2) = 𝑧)
113	112	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → (𝑃‘2) = 𝑧)
114	109, 113	preq12d 4700	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → {(𝑃‘1), (𝑃‘2)} = {𝑦, 𝑧})
115	114	eqeq2d 2748	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → ((𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)} ↔ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))
116	111, 115	anbi12d 633	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) ↔ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))
117	116	biimpa 476	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))
118	105, 117	jca 511	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑥 = (𝑃‘0) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))
119	118	exp41 434	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑃‘0) → (𝑦 = (𝑃‘1) → (𝑧 = (𝑃‘2) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
120	119	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) → (𝑦 = (𝑃‘1) → (𝑧 = (𝑃‘2) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
121	120	imp31 417	. . . . . . . . . . . . 13 ⊢ (((((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) ∧ 𝑦 = (𝑃‘1)) ∧ 𝑧 = (𝑃‘2)) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))
122	99, 121	rspcimedv 3569	. . . . . . . . . . . 12 ⊢ ((((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) ∧ 𝑦 = (𝑃‘1)) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → ∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))
123	37, 122	rspcimedv 3569	. . . . . . . . . . 11 ⊢ (((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) ∧ 𝑥 = (𝑃‘0)) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))
124	8, 123	rspcimedv 3569	. . . . . . . . . 10 ⊢ ((((𝐹:(0..^2)–1-1→dom 𝐼 ∧ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) ∧ 𝐺 ∈ USGraph) ∧ 𝑃:(0...2)⟶𝑉) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))
125	124	exp41 434	. . . . . . . . 9 ⊢ (𝐹:(0..^2)–1-1→dom 𝐼 → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝐺 ∈ USGraph → (𝑃:(0...2)⟶𝑉 → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))))))
126	125	com15 101	. . . . . . . 8 ⊢ (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝐺 ∈ USGraph → (𝑃:(0...2)⟶𝑉 → (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))))))
127	126	pm2.43i 52	. . . . . . 7 ⊢ (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝐺 ∈ USGraph → (𝑃:(0...2)⟶𝑉 → (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
128	127	com12 32	. . . . . 6 ⊢ (𝐺 ∈ USGraph → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝑃:(0...2)⟶𝑉 → (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
129	128	adantr 480	. . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → (((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝑃:(0...2)⟶𝑉 → (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
130		oveq2 7376	. . . . . . . 8 ⊢ ((♯‘𝐹) = 2 → (0..^(♯‘𝐹)) = (0..^2))
131	130	raleqdv 3298	. . . . . . 7 ⊢ ((♯‘𝐹) = 2 → (∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} ↔ ∀𝑖 ∈ (0..^2)(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))}))
132		fzo0to2pr 13678	. . . . . . . . 9 ⊢ (0..^2) = {0, 1}
133	132	raleqi 3296	. . . . . . . 8 ⊢ (∀𝑖 ∈ (0..^2)(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} ↔ ∀𝑖 ∈ {0, 1} (𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))})
134		2wlklem 29751	. . . . . . . 8 ⊢ (∀𝑖 ∈ {0, 1} (𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} ↔ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
135	133, 134	bitri 275	. . . . . . 7 ⊢ (∀𝑖 ∈ (0..^2)(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} ↔ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
136	131, 135	bitrdi 287	. . . . . 6 ⊢ ((♯‘𝐹) = 2 → (∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} ↔ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})))
137	136	adantl 481	. . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → (∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} ↔ ((𝐼‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐼‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})))
138		oveq2 7376	. . . . . . . 8 ⊢ ((♯‘𝐹) = 2 → (0...(♯‘𝐹)) = (0...2))
139	138	feq2d 6654	. . . . . . 7 ⊢ ((♯‘𝐹) = 2 → (𝑃:(0...(♯‘𝐹))⟶𝑉 ↔ 𝑃:(0...2)⟶𝑉))
140	139	adantl 481	. . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → (𝑃:(0...(♯‘𝐹))⟶𝑉 ↔ 𝑃:(0...2)⟶𝑉))
141		f1eq2 6734	. . . . . . . . 9 ⊢ ((0..^(♯‘𝐹)) = (0..^2) → (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ↔ 𝐹:(0..^2)–1-1→dom 𝐼))
142	130, 141	syl 17	. . . . . . . 8 ⊢ ((♯‘𝐹) = 2 → (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ↔ 𝐹:(0..^2)–1-1→dom 𝐼))
143	142	imbi1d 341	. . . . . . 7 ⊢ ((♯‘𝐹) = 2 → ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))) ↔ (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))))
144	143	adantl 481	. . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))) ↔ (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))))
145	140, 144	imbi12d 344	. . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → ((𝑃:(0...(♯‘𝐹))⟶𝑉 → (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧})))) ↔ (𝑃:(0...2)⟶𝑉 → (𝐹:(0..^2)–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
146	129, 137, 145	3imtr4d 294	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → (∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} → (𝑃:(0...(♯‘𝐹))⟶𝑉 → (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
147	146	com14 96	. . 3 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → (∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} → (𝑃:(0...(♯‘𝐹))⟶𝑉 → ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
148	147	com23 86	. 2 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → (𝑃:(0...(♯‘𝐹))⟶𝑉 → (∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))} → ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))))
149	148	3imp 1111	1 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑖 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑖)) = {(𝑃‘𝑖), (𝑃‘(𝑖 + 1))}) → ((𝐺 ∈ USGraph ∧ (♯‘𝐹) = 2) → ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ (𝑉 ∖ {𝑥})∃𝑧 ∈ (𝑉 ∖ {𝑥, 𝑦})(((𝑃‘0) = 𝑥 ∧ (𝑃‘1) = 𝑦 ∧ (𝑃‘2) = 𝑧) ∧ ((𝐼‘(𝐹‘0)) = {𝑥, 𝑦} ∧ (𝐼‘(𝐹‘1)) = {𝑦, 𝑧}))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∃wrex 3062 Vcvv 3442 ∖ cdif 3900 {csn 4582 {cpr 4584 class class class wbr 5100 dom cdm 5632 ran crn 5633 ⟶wf 6496 –1-1→wf1 6497 ‘cfv 6500 (class class class)co 7368 0cc0 11038 1c1 11039 + caddc 11041 < clt 11178 ≤ cle 11179 ℕcn 12157 2c2 12212 ℕ₀cn0 12413 ...cfz 13435 ..^cfzo 13582 ♯chash 14265 Vtxcvtx 29081 iEdgciedg 29082 USGraphcusgr 29234

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-oadd 8411 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-dju 9825 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-n0 12414 df-z 12501 df-uz 12764 df-fz 13436 df-fzo 13583 df-hash 14266 df-umgr 29168 df-usgr 29236

This theorem is referenced by: usgr2pth 29849

W3C validator