| 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 15071 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 〈“𝑋𝑌”〉 ∈ Word 𝑉) | |
| 2 | 1 | 3adant3 1150 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → 〈“𝑋𝑌”〉 ∈ Word 𝑉) |
| 3 | s2len 15082 | . . . 4 ⊢ (♯‘〈“𝑋𝑌”〉) = 2 | |
| 4 | 3 | a1i 11 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → (♯‘〈“𝑋𝑌”〉) = 2) |
| 5 | s2fv0 15080 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (〈“𝑋𝑌”〉‘0) = 𝑋) | |
| 6 | 5 | adantr 486 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (〈“𝑋𝑌”〉‘0) = 𝑋) |
| 7 | s2fv1 15081 | . . . . . . . 8 ⊢ (𝑌 ∈ 𝑉 → (〈“𝑋𝑌”〉‘1) = 𝑌) | |
| 8 | 7 | adantl 487 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (〈“𝑋𝑌”〉‘1) = 𝑌) |
| 9 | 6, 8 | preq12d 4704 | . . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} = {𝑋, 𝑌}) |
| 10 | 9 | eqcomd 2769 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {𝑋, 𝑌} = {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)}) |
| 11 | 10 | eleq1d 2849 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ({𝑋, 𝑌} ∈ 𝐸 ↔ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸)) |
| 12 | 11 | biimp3a 1499 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸) |
| 13 | 6 | 3adant3 1150 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → (〈“𝑋𝑌”〉‘0) = 𝑋) |
| 14 | 4, 12, 13 | 3jca 1146 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → ((♯‘〈“𝑋𝑌”〉) = 2 ∧ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸 ∧ (〈“𝑋𝑌”〉‘0) = 𝑋)) |
| 15 | fveqeq2 6925 | . . . 4 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → ((♯‘𝑤) = 2 ↔ (♯‘〈“𝑋𝑌”〉) = 2)) | |
| 16 | fveq1 6915 | . . . . . 6 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → (𝑤‘0) = (〈“𝑋𝑌”〉‘0)) | |
| 17 | fveq1 6915 | . . . . . 6 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → (𝑤‘1) = (〈“𝑋𝑌”〉‘1)) | |
| 18 | 16, 17 | preq12d 4704 | . . . . 5 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → {(𝑤‘0), (𝑤‘1)} = {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)}) |
| 19 | 18 | eleq1d 2849 | . . . 4 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝐸 ↔ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸)) |
| 20 | 16 | eqeq1d 2765 | . . . 4 ⊢ (𝑤 = 〈“𝑋𝑌”〉 → ((𝑤‘0) = 𝑋 ↔ (〈“𝑋𝑌”〉‘0) = 𝑋)) |
| 21 | 15, 19, 20 | 3anbi123d 1465 | . . 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 30751 | . . 3 ⊢ (𝑋𝐶2) = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝐸 ∧ (𝑤‘0) = 𝑋)} |
| 26 | 21, 25 | elrab2 3652 | . 2 ⊢ (〈“𝑋𝑌”〉 ∈ (𝑋𝐶2) ↔ (〈“𝑋𝑌”〉 ∈ Word 𝑉 ∧ ((♯‘〈“𝑋𝑌”〉) = 2 ∧ {(〈“𝑋𝑌”〉‘0), (〈“𝑋𝑌”〉‘1)} ∈ 𝐸 ∧ (〈“𝑋𝑌”〉‘0) = 𝑋))) |
| 27 | 2, 14, 26 | sylanbrc 595 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉 ∧ {𝑋, 𝑌} ∈ 𝐸) → 〈“𝑋𝑌”〉 ∈ (𝑋𝐶2)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 {cpr 4590 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 2c2 12437 ♯chash 14515 Word cword 14699 〈“cs2 15034 Vtxcvtx 29631 Edgcedg 29682 ClWWalksNOncclwwlknon 30735 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-lsw 14749 df-concat 14757 df-s1 14784 df-s2 15041 df-clwwlk 30630 df-clwwlkn 30673 df-clwwlknon 30736 |
| This theorem is used by: 2clwwlk2clwwlklem 31004 |
| Copyright terms: Public domain | W3C validator |