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

Theorem uspgrn2crct 27578
 Description: In a simple pseudograph there are no circuits with length 2 (consisting of two edges). (Contributed by Alexander van der Vekens, 9-Nov-2017.) (Revised by AV, 3-Feb-2021.) (Proof shortened by AV, 31-Oct-2021.)
Assertion
Ref Expression
uspgrn2crct ((𝐺 ∈ USPGraph ∧ 𝐹(Circuits‘𝐺)𝑃) → (♯‘𝐹) ≠ 2)

Proof of Theorem uspgrn2crct
Dummy variables 𝑥 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 crctprop 27565 . . 3 (𝐹(Circuits‘𝐺)𝑃 → (𝐹(Trails‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))))
2 istrl 27470 . . . . . . 7 (𝐹(Trails‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹))
3 uspgrupgr 26953 . . . . . . . . 9 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
4 eqid 2819 . . . . . . . . . . . . 13 (Vtx‘𝐺) = (Vtx‘𝐺)
5 eqid 2819 . . . . . . . . . . . . 13 (iEdg‘𝐺) = (iEdg‘𝐺)
64, 5upgriswlk 27414 . . . . . . . . . . . 12 (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})))
7 preq2 4662 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑃‘2) = (𝑃‘0) → {(𝑃‘1), (𝑃‘2)} = {(𝑃‘1), (𝑃‘0)})
8 prcom 4660 . . . . . . . . . . . . . . . . . . . . . . . . . 26 {(𝑃‘1), (𝑃‘0)} = {(𝑃‘0), (𝑃‘1)}
97, 8syl6eq 2870 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑃‘2) = (𝑃‘0) → {(𝑃‘1), (𝑃‘2)} = {(𝑃‘0), (𝑃‘1)})
109eqcoms 2827 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑃‘0) = (𝑃‘2) → {(𝑃‘1), (𝑃‘2)} = {(𝑃‘0), (𝑃‘1)})
1110eqeq2d 2830 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑃‘0) = (𝑃‘2) → (((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)} ↔ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘0), (𝑃‘1)}))
1211anbi2d 630 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑃‘0) = (𝑃‘2) → ((((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) ↔ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘0), (𝑃‘1)})))
1312ad2antrr 724 . . . . . . . . . . . . . . . . . . . . 21 ((((𝑃‘0) = (𝑃‘2) ∧ ((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph))) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → ((((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) ↔ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘0), (𝑃‘1)})))
14 eqtr3 2841 . . . . . . . . . . . . . . . . . . . . . 22 ((((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘0), (𝑃‘1)}) → ((iEdg‘𝐺)‘(𝐹‘0)) = ((iEdg‘𝐺)‘(𝐹‘1)))
154, 5uspgrf 26931 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
1615adantl 484 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((Fun 𝐹𝐺 ∈ USPGraph) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
1716adantl 484 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
1817adantr 483 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
19 df-f1 6353 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 (𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺) ↔ (𝐹:(0..^(♯‘𝐹))⟶dom (iEdg‘𝐺) ∧ Fun 𝐹))
2019simplbi2 503 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (𝐹:(0..^(♯‘𝐹))⟶dom (iEdg‘𝐺) → (Fun 𝐹𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺)))
21 wrdf 13858 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (𝐹 ∈ Word dom (iEdg‘𝐺) → 𝐹:(0..^(♯‘𝐹))⟶dom (iEdg‘𝐺))
2220, 21syl11 33 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (Fun 𝐹 → (𝐹 ∈ Word dom (iEdg‘𝐺) → 𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺)))
2322adantr 483 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((Fun 𝐹𝐺 ∈ USPGraph) → (𝐹 ∈ Word dom (iEdg‘𝐺) → 𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺)))
2423adantl 484 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → (𝐹 ∈ Word dom (iEdg‘𝐺) → 𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺)))
2524imp 409 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → 𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺))
26 2nn 11702 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 2 ∈ ℕ
27 lbfzo0 13069 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (0 ∈ (0..^2) ↔ 2 ∈ ℕ)
2826, 27mpbir 233 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 0 ∈ (0..^2)
29 1nn0 11905 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 1 ∈ ℕ0
30 1lt2 11800 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 1 < 2
31 elfzo0 13070 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (1 ∈ (0..^2) ↔ (1 ∈ ℕ0 ∧ 2 ∈ ℕ ∧ 1 < 2))
3229, 26, 30, 31mpbir3an 1335 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 1 ∈ (0..^2)
3328, 32pm3.2i 473 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (0 ∈ (0..^2) ∧ 1 ∈ (0..^2))
34 oveq2 7156 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ((♯‘𝐹) = 2 → (0..^(♯‘𝐹)) = (0..^2))
3534eleq2d 2896 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ((♯‘𝐹) = 2 → (0 ∈ (0..^(♯‘𝐹)) ↔ 0 ∈ (0..^2)))
3634eleq2d 2896 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ((♯‘𝐹) = 2 → (1 ∈ (0..^(♯‘𝐹)) ↔ 1 ∈ (0..^2)))
3735, 36anbi12d 632 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((♯‘𝐹) = 2 → ((0 ∈ (0..^(♯‘𝐹)) ∧ 1 ∈ (0..^(♯‘𝐹))) ↔ (0 ∈ (0..^2) ∧ 1 ∈ (0..^2))))
3833, 37mpbiri 260 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((♯‘𝐹) = 2 → (0 ∈ (0..^(♯‘𝐹)) ∧ 1 ∈ (0..^(♯‘𝐹))))
3938ad2antrr 724 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → (0 ∈ (0..^(♯‘𝐹)) ∧ 1 ∈ (0..^(♯‘𝐹))))
40 f1cofveqaeq 7008 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ 𝐹:(0..^(♯‘𝐹))–1-1→dom (iEdg‘𝐺)) ∧ (0 ∈ (0..^(♯‘𝐹)) ∧ 1 ∈ (0..^(♯‘𝐹)))) → (((iEdg‘𝐺)‘(𝐹‘0)) = ((iEdg‘𝐺)‘(𝐹‘1)) → 0 = 1))
4118, 25, 39, 40syl21anc 835 . . . . . . . . . . . . . . . . . . . . . . . 24 ((((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → (((iEdg‘𝐺)‘(𝐹‘0)) = ((iEdg‘𝐺)‘(𝐹‘1)) → 0 = 1))
42 0ne1 11700 . . . . . . . . . . . . . . . . . . . . . . . 24 0 ≠ 1
43 eqneqall 3025 . . . . . . . . . . . . . . . . . . . . . . . 24 (0 = 1 → (0 ≠ 1 → (𝑃‘0) ≠ (𝑃‘2)))
4441, 42, 43syl6mpi 67 . . . . . . . . . . . . . . . . . . . . . . 23 ((((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → (((iEdg‘𝐺)‘(𝐹‘0)) = ((iEdg‘𝐺)‘(𝐹‘1)) → (𝑃‘0) ≠ (𝑃‘2)))
4544adantll 712 . . . . . . . . . . . . . . . . . . . . . 22 ((((𝑃‘0) = (𝑃‘2) ∧ ((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph))) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → (((iEdg‘𝐺)‘(𝐹‘0)) = ((iEdg‘𝐺)‘(𝐹‘1)) → (𝑃‘0) ≠ (𝑃‘2)))
4614, 45syl5 34 . . . . . . . . . . . . . . . . . . . . 21 ((((𝑃‘0) = (𝑃‘2) ∧ ((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph))) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → ((((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘0), (𝑃‘1)}) → (𝑃‘0) ≠ (𝑃‘2)))
4713, 46sylbid 242 . . . . . . . . . . . . . . . . . . . 20 ((((𝑃‘0) = (𝑃‘2) ∧ ((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph))) ∧ 𝐹 ∈ Word dom (iEdg‘𝐺)) → ((((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}) → (𝑃‘0) ≠ (𝑃‘2)))
4847expimpd 456 . . . . . . . . . . . . . . . . . . 19 (((𝑃‘0) = (𝑃‘2) ∧ ((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph))) → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (𝑃‘0) ≠ (𝑃‘2)))
4948ex 415 . . . . . . . . . . . . . . . . . 18 ((𝑃‘0) = (𝑃‘2) → (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (𝑃‘0) ≠ (𝑃‘2))))
50 2a1 28 . . . . . . . . . . . . . . . . . 18 ((𝑃‘0) ≠ (𝑃‘2) → (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (𝑃‘0) ≠ (𝑃‘2))))
5149, 50pm2.61ine 3098 . . . . . . . . . . . . . . . . 17 (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (𝑃‘0) ≠ (𝑃‘2)))
52 fzo0to2pr 13114 . . . . . . . . . . . . . . . . . . . . . . 23 (0..^2) = {0, 1}
5334, 52syl6eq 2870 . . . . . . . . . . . . . . . . . . . . . 22 ((♯‘𝐹) = 2 → (0..^(♯‘𝐹)) = {0, 1})
5453raleqdv 3414 . . . . . . . . . . . . . . . . . . . . 21 ((♯‘𝐹) = 2 → (∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ ∀𝑘 ∈ {0, 1} ((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}))
55 2wlklem 27441 . . . . . . . . . . . . . . . . . . . . 21 (∀𝑘 ∈ {0, 1} ((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
5654, 55syl6bb 289 . . . . . . . . . . . . . . . . . . . 20 ((♯‘𝐹) = 2 → (∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})))
5756anbi2d 630 . . . . . . . . . . . . . . . . . . 19 ((♯‘𝐹) = 2 → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) ↔ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))))
58 fveq2 6663 . . . . . . . . . . . . . . . . . . . 20 ((♯‘𝐹) = 2 → (𝑃‘(♯‘𝐹)) = (𝑃‘2))
5958neeq2d 3074 . . . . . . . . . . . . . . . . . . 19 ((♯‘𝐹) = 2 → ((𝑃‘0) ≠ (𝑃‘(♯‘𝐹)) ↔ (𝑃‘0) ≠ (𝑃‘2)))
6057, 59imbi12d 347 . . . . . . . . . . . . . . . . . 18 ((♯‘𝐹) = 2 → (((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))) ↔ ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (𝑃‘0) ≠ (𝑃‘2))))
6160adantr 483 . . . . . . . . . . . . . . . . 17 (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → (((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))) ↔ ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ (((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ ((iEdg‘𝐺)‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)})) → (𝑃‘0) ≠ (𝑃‘2))))
6251, 61mpbird 259 . . . . . . . . . . . . . . . 16 (((♯‘𝐹) = 2 ∧ (Fun 𝐹𝐺 ∈ USPGraph)) → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))))
6362ex 415 . . . . . . . . . . . . . . 15 ((♯‘𝐹) = 2 → ((Fun 𝐹𝐺 ∈ USPGraph) → ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹)))))
6463com13 88 . . . . . . . . . . . . . 14 ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → ((Fun 𝐹𝐺 ∈ USPGraph) → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹)))))
6564expd 418 . . . . . . . . . . . . 13 ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → (Fun 𝐹 → (𝐺 ∈ USPGraph → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))))))
66653adant2 1125 . . . . . . . . . . . 12 ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))((iEdg‘𝐺)‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))}) → (Fun 𝐹 → (𝐺 ∈ USPGraph → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))))))
676, 66syl6bi 255 . . . . . . . . . . 11 (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 → (Fun 𝐹 → (𝐺 ∈ USPGraph → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹)))))))
6867impd 413 . . . . . . . . . 10 (𝐺 ∈ UPGraph → ((𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹) → (𝐺 ∈ USPGraph → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))))))
6968com23 86 . . . . . . . . 9 (𝐺 ∈ UPGraph → (𝐺 ∈ USPGraph → ((𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹) → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))))))
703, 69mpcom 38 . . . . . . . 8 (𝐺 ∈ USPGraph → ((𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹) → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹)))))
7170com12 32 . . . . . . 7 ((𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹) → (𝐺 ∈ USPGraph → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹)))))
722, 71sylbi 219 . . . . . 6 (𝐹(Trails‘𝐺)𝑃 → (𝐺 ∈ USPGraph → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹)))))
7372imp 409 . . . . 5 ((𝐹(Trails‘𝐺)𝑃𝐺 ∈ USPGraph) → ((♯‘𝐹) = 2 → (𝑃‘0) ≠ (𝑃‘(♯‘𝐹))))
7473necon2d 3037 . . . 4 ((𝐹(Trails‘𝐺)𝑃𝐺 ∈ USPGraph) → ((𝑃‘0) = (𝑃‘(♯‘𝐹)) → (♯‘𝐹) ≠ 2))
7574impancom 454 . . 3 ((𝐹(Trails‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))) → (𝐺 ∈ USPGraph → (♯‘𝐹) ≠ 2))
761, 75syl 17 . 2 (𝐹(Circuits‘𝐺)𝑃 → (𝐺 ∈ USPGraph → (♯‘𝐹) ≠ 2))
7776impcom 410 1 ((𝐺 ∈ USPGraph ∧ 𝐹(Circuits‘𝐺)𝑃) → (♯‘𝐹) ≠ 2)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1081   = wceq 1530   ∈ wcel 2107   ≠ wne 3014  ∀wral 3136  {crab 3140   ∖ cdif 3931  ∅c0 4289  𝒫 cpw 4537  {csn 4559  {cpr 4561   class class class wbr 5057  ◡ccnv 5547  dom cdm 5548  Fun wfun 6342  ⟶wf 6344  –1-1→wf1 6345  ‘cfv 6348  (class class class)co 7148  0cc0 10529  1c1 10530   + caddc 10532   < clt 10667   ≤ cle 10668  ℕcn 11630  2c2 11684  ℕ0cn0 11889  ...cfz 12884  ..^cfzo 13025  ♯chash 13682  Word cword 13853  Vtxcvtx 26773  iEdgciedg 26774  UPGraphcupgr 26857  USPGraphcuspgr 26925  Walkscwlks 27370  Trailsctrls 27464  Circuitsccrcts 27557 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ifp 1057  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-int 4868  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-1st 7681  df-2nd 7682  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-1o 8094  df-2o 8095  df-oadd 8098  df-er 8281  df-map 8400  df-pm 8401  df-en 8502  df-dom 8503  df-sdom 8504  df-fin 8505  df-dju 9322  df-card 9360  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-nn 11631  df-2 11692  df-n0 11890  df-xnn0 11960  df-z 11974  df-uz 12236  df-fz 12885  df-fzo 13026  df-hash 13683  df-word 13854  df-edg 26825  df-uhgr 26835  df-upgr 26859  df-uspgr 26927  df-wlks 27373  df-trls 27466  df-crcts 27559 This theorem is referenced by:  usgrn2cycl  27579
 Copyright terms: Public domain W3C validator