Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > usgr2wlkspthlem2 | Structured version Visualization version GIF version |
Description: Lemma 2 for usgr2wlkspth 40965. (Contributed by Alexander van der Vekens, 2-Mar-2018.) (Revised by AV, 27-Jan-2021.) |
Ref | Expression |
---|---|
usgr2wlkspthlem2 | ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → Fun ◡𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1054 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹))) → 𝐺 ∈ USGraph ) | |
2 | 1 | anim2i 591 | . . . . 5 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → (𝐹(1Walks‘𝐺)𝑃 ∧ 𝐺 ∈ USGraph )) |
3 | 2 | ancomd 466 | . . . 4 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → (𝐺 ∈ USGraph ∧ 𝐹(1Walks‘𝐺)𝑃)) |
4 | 3simpc 1053 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹))) → ((#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) | |
5 | 4 | adantl 481 | . . . 4 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → ((#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) |
6 | usgr2wlkneq 40962 | . . . 4 ⊢ (((𝐺 ∈ USGraph ∧ 𝐹(1Walks‘𝐺)𝑃) ∧ ((#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → (((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2)) ∧ (𝐹‘0) ≠ (𝐹‘1))) | |
7 | 3, 5, 6 | syl2anc 691 | . . 3 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → (((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2)) ∧ (𝐹‘0) ≠ (𝐹‘1))) |
8 | simpl 472 | . . . 4 ⊢ ((((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2)) ∧ (𝐹‘0) ≠ (𝐹‘1)) → ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2))) | |
9 | fvex 6113 | . . . . 5 ⊢ (𝑃‘0) ∈ V | |
10 | fvex 6113 | . . . . 5 ⊢ (𝑃‘1) ∈ V | |
11 | fvex 6113 | . . . . 5 ⊢ (𝑃‘2) ∈ V | |
12 | 9, 10, 11 | 3pm3.2i 1232 | . . . 4 ⊢ ((𝑃‘0) ∈ V ∧ (𝑃‘1) ∈ V ∧ (𝑃‘2) ∈ V) |
13 | 8, 12 | jctil 558 | . . 3 ⊢ ((((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2)) ∧ (𝐹‘0) ≠ (𝐹‘1)) → (((𝑃‘0) ∈ V ∧ (𝑃‘1) ∈ V ∧ (𝑃‘2) ∈ V) ∧ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2)))) |
14 | funcnvs3 13509 | . . 3 ⊢ ((((𝑃‘0) ∈ V ∧ (𝑃‘1) ∈ V ∧ (𝑃‘2) ∈ V) ∧ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘0) ≠ (𝑃‘2) ∧ (𝑃‘1) ≠ (𝑃‘2))) → Fun ◡〈“(𝑃‘0)(𝑃‘1)(𝑃‘2)”〉) | |
15 | 7, 13, 14 | 3syl 18 | . 2 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → Fun ◡〈“(𝑃‘0)(𝑃‘1)(𝑃‘2)”〉) |
16 | eqid 2610 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
17 | 16 | 1wlkpwrd 40822 | . . . . 5 ⊢ (𝐹(1Walks‘𝐺)𝑃 → 𝑃 ∈ Word (Vtx‘𝐺)) |
18 | 1wlklenvp1 40823 | . . . . . 6 ⊢ (𝐹(1Walks‘𝐺)𝑃 → (#‘𝑃) = ((#‘𝐹) + 1)) | |
19 | oveq1 6556 | . . . . . . . 8 ⊢ ((#‘𝐹) = 2 → ((#‘𝐹) + 1) = (2 + 1)) | |
20 | 2p1e3 11028 | . . . . . . . 8 ⊢ (2 + 1) = 3 | |
21 | 19, 20 | syl6eq 2660 | . . . . . . 7 ⊢ ((#‘𝐹) = 2 → ((#‘𝐹) + 1) = 3) |
22 | 21 | 3ad2ant2 1076 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹))) → ((#‘𝐹) + 1) = 3) |
23 | 18, 22 | sylan9eq 2664 | . . . . 5 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → (#‘𝑃) = 3) |
24 | wrdlen3s3 13540 | . . . . 5 ⊢ ((𝑃 ∈ Word (Vtx‘𝐺) ∧ (#‘𝑃) = 3) → 𝑃 = 〈“(𝑃‘0)(𝑃‘1)(𝑃‘2)”〉) | |
25 | 17, 23, 24 | syl2an2r 872 | . . . 4 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → 𝑃 = 〈“(𝑃‘0)(𝑃‘1)(𝑃‘2)”〉) |
26 | 25 | cnveqd 5220 | . . 3 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → ◡𝑃 = ◡〈“(𝑃‘0)(𝑃‘1)(𝑃‘2)”〉) |
27 | 26 | funeqd 5825 | . 2 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → (Fun ◡𝑃 ↔ Fun ◡〈“(𝑃‘0)(𝑃‘1)(𝑃‘2)”〉)) |
28 | 15, 27 | mpbird 246 | 1 ⊢ ((𝐹(1Walks‘𝐺)𝑃 ∧ (𝐺 ∈ USGraph ∧ (#‘𝐹) = 2 ∧ (𝑃‘0) ≠ (𝑃‘(#‘𝐹)))) → Fun ◡𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 Vcvv 3173 class class class wbr 4583 ◡ccnv 5037 Fun wfun 5798 ‘cfv 5804 (class class class)co 6549 0cc0 9815 1c1 9816 + caddc 9818 2c2 10947 3c3 10948 #chash 12979 Word cword 13146 〈“cs3 13438 Vtxcvtx 25673 USGraph cusgr 40379 1Walksc1wlks 40796 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-ifp 1007 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 df-hash 12980 df-word 13154 df-concat 13156 df-s1 13157 df-s2 13444 df-s3 13445 df-uhgr 25724 df-upgr 25749 df-umgr 25750 df-edga 25793 df-uspgr 40380 df-usgr 40381 df-1wlks 40800 df-wlks 40801 |
This theorem is referenced by: usgr2wlkspth 40965 |
Copyright terms: Public domain | W3C validator |