![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > s2elclwwlknon2 | Structured version Visualization version GIF version |
Description: Sufficient conditions of a doubleton word to represent a closed walk on vertex 𝑋 of length 2. (Contributed by AV, 11-May-2022.) |
Ref | Expression |
---|---|
clwwlknon2.c | ⊢ 𝐶 = (ClWWalksNOn‘𝐺) |
clwwlknon2x.v | ⊢ 𝑉 = (Vtx‘𝐺) |
clwwlknon2x.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
s2elclwwlknon2 | ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → 〈“𝑋𝑌”〉 ∈ (𝑋𝐶2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | s2cl 14231 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 〈“𝑋𝑌”〉 ∈ Word 𝑉) | |
2 | 1 | 3adant3 1129 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → 〈“𝑋𝑌”〉 ∈ Word 𝑉) |
3 | s2len 14242 | . . . 4 ⊢ (♯‘〈“𝑋𝑌”〉) = 2 | |
4 | 3 | a1i 11 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → (♯‘〈“𝑋𝑌”〉) = 2) |
5 | s2fv0 14240 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (〈“𝑋𝑌”〉‘0) = 𝑋) | |
6 | 5 | adantr 484 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (〈“𝑋𝑌”〉‘0) = 𝑋) |
7 | s2fv1 14241 | . . . . . . . 8 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑋𝑌”〉‘1) = 𝑌) | |
8 | 7 | adantl 485 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (〈“𝑋𝑌”〉‘1) = 𝑌) |
9 | 6, 8 | preq12d 4637 | . . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} = {𝑋, 𝑌}) |
10 | 9 | eqcomd 2804 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {𝑋, 𝑌} = {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)}) |
11 | 10 | eleq1d 2874 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ({𝑋, 𝑌} ∈ 𝐸 ↔ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸)) |
12 | 11 | biimp3a 1466 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸) |
13 | 6 | 3adant3 1129 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → (〈“𝑋𝑌”〉‘0) = 𝑋) |
14 | 4, 12, 13 | 3jca 1125 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → ((♯‘〈“𝑋𝑌”〉) = 2 ∧ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸 ∧ (〈“𝑋𝑌”〉‘0) = 𝑋)) |
15 | fveqeq2 6654 | . . . 4 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → ((♯‘𝑤) = 2 ↔ (♯‘〈“𝑋𝑌”〉) = 2)) | |
16 | fveq1 6644 | . . . . . 6 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → (𝑤‘0) = (〈“𝑋𝑌”〉‘0)) | |
17 | fveq1 6644 | . . . . . 6 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → (𝑤‘1) = (〈“𝑋𝑌”〉‘1)) | |
18 | 16, 17 | preq12d 4637 | . . . . 5 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → {(𝑤‘0), (𝑤‘1)} = {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)}) |
19 | 18 | eleq1d 2874 | . . . 4 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝐸 ↔ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸)) |
20 | 16 | eqeq1d 2800 | . . . 4 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → ((𝑤‘0) = 𝑋 ↔ (〈“𝑋𝑌”〉‘0) = 𝑋)) |
21 | 15, 19, 20 | 3anbi123d 1433 | . . 3 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → (((♯‘𝑤) = 2 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝐸 ∧ (𝑤‘0) = 𝑋) ↔ ((♯‘〈“𝑋𝑌”〉) = 2 ∧ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸 ∧ (〈“𝑋𝑌”〉‘0) = 𝑋))) |
22 | clwwlknon2.c | . . . 4 ⊢ 𝐶 = (ClWWalksNOn‘𝐺) | |
23 | clwwlknon2x.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
24 | clwwlknon2x.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
25 | 22, 23, 24 | clwwlknon2x 27888 | . . 3 ⊢ (𝑋𝐶2) = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝐸 ∧ (𝑤‘0) = 𝑋)} |
26 | 21, 25 | elrab2 3631 | . 2 ⊢ (〈“𝑋𝑌”〉 ∈ (𝑋𝐶2) ↔ (〈“𝑋𝑌”〉 ∈ Word 𝑉 ∧ ((♯‘〈“𝑋𝑌”〉) = 2 ∧ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸 ∧ (〈“𝑋𝑌”〉‘0) = 𝑋))) |
27 | 2, 14, 26 | sylanbrc 586 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → 〈“𝑋𝑌”〉 ∈ (𝑋𝐶2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 {cpr 4527 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 2c2 11680 ♯chash 13686 Word cword 13857 〈“cs2 14194 Vtxcvtx 26789 Edgcedg 26840 ClWWalksNOncclwwlknon 27872 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-lsw 13906 df-concat 13914 df-s1 13941 df-s2 14201 df-clwwlk 27767 df-clwwlkn 27810 df-clwwlknon 27873 |
This theorem is referenced by: 2clwwlk2clwwlklem 28131 |
Copyright terms: Public domain | W3C validator |