![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clwwlknon1nloop | Structured version Visualization version GIF version |
Description: If there is no loop at vertex 𝑋, the set of (closed) walks on 𝑋 of length 1 as words over the set of vertices is empty. (Contributed by AV, 11-Feb-2022.) (Revised by AV, 25-Mar-2022.) |
Ref | Expression |
---|---|
clwwlknon1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
clwwlknon1.c | ⊢ 𝐶 = (ClWWalksNOn‘𝐺) |
clwwlknon1.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
clwwlknon1nloop | ⊢ ({𝑋} ∉ 𝐸 → (𝑋𝐶1) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clwwlknon1.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | clwwlknon1.c | . . . . 5 ⊢ 𝐶 = (ClWWalksNOn‘𝐺) | |
3 | clwwlknon1.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
4 | 1, 2, 3 | clwwlknon1 27882 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → (𝑋𝐶1) = {𝑤 ∈ Word 𝑉 ∣ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)}) |
5 | 4 | adantr 484 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) → (𝑋𝐶1) = {𝑤 ∈ Word 𝑉 ∣ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)}) |
6 | df-nel 3092 | . . . . . . . . 9 ⊢ ({𝑋} ∉ 𝐸 ↔ ¬ {𝑋} ∈ 𝐸) | |
7 | 6 | biimpi 219 | . . . . . . . 8 ⊢ ({𝑋} ∉ 𝐸 → ¬ {𝑋} ∈ 𝐸) |
8 | 7 | olcd 871 | . . . . . . 7 ⊢ ({𝑋} ∉ 𝐸 → (¬ 𝑤 = 〈“𝑋”〉 ∨ ¬ {𝑋} ∈ 𝐸)) |
9 | 8 | ad2antlr 726 | . . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) ∧ 𝑤 ∈ Word 𝑉) → (¬ 𝑤 = 〈“𝑋”〉 ∨ ¬ {𝑋} ∈ 𝐸)) |
10 | ianor 979 | . . . . . 6 ⊢ (¬ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸) ↔ (¬ 𝑤 = 〈“𝑋”〉 ∨ ¬ {𝑋} ∈ 𝐸)) | |
11 | 9, 10 | sylibr 237 | . . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) ∧ 𝑤 ∈ Word 𝑉) → ¬ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)) |
12 | 11 | ralrimiva 3149 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) → ∀𝑤 ∈ Word 𝑉 ¬ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)) |
13 | rabeq0 4292 | . . . 4 ⊢ ({𝑤 ∈ Word 𝑉 ∣ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)} = ∅ ↔ ∀𝑤 ∈ Word 𝑉 ¬ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)) | |
14 | 12, 13 | sylibr 237 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) → {𝑤 ∈ Word 𝑉 ∣ (𝑤 = 〈“𝑋”〉 ∧ {𝑋} ∈ 𝐸)} = ∅) |
15 | 5, 14 | eqtrd 2833 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) → (𝑋𝐶1) = ∅) |
16 | 2 | oveqi 7148 | . . . 4 ⊢ (𝑋𝐶1) = (𝑋(ClWWalksNOn‘𝐺)1) |
17 | 1 | eleq2i 2881 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 ↔ 𝑋 ∈ (Vtx‘𝐺)) |
18 | 17 | notbii 323 | . . . . . . 7 ⊢ (¬ 𝑋 ∈ 𝑉 ↔ ¬ 𝑋 ∈ (Vtx‘𝐺)) |
19 | 18 | biimpi 219 | . . . . . 6 ⊢ (¬ 𝑋 ∈ 𝑉 → ¬ 𝑋 ∈ (Vtx‘𝐺)) |
20 | 19 | intnanrd 493 | . . . . 5 ⊢ (¬ 𝑋 ∈ 𝑉 → ¬ (𝑋 ∈ (Vtx‘𝐺) ∧ 1 ∈ ℕ)) |
21 | clwwlknon0 27878 | . . . . 5 ⊢ (¬ (𝑋 ∈ (Vtx‘𝐺) ∧ 1 ∈ ℕ) → (𝑋(ClWWalksNOn‘𝐺)1) = ∅) | |
22 | 20, 21 | syl 17 | . . . 4 ⊢ (¬ 𝑋 ∈ 𝑉 → (𝑋(ClWWalksNOn‘𝐺)1) = ∅) |
23 | 16, 22 | syl5eq 2845 | . . 3 ⊢ (¬ 𝑋 ∈ 𝑉 → (𝑋𝐶1) = ∅) |
24 | 23 | adantr 484 | . 2 ⊢ ((¬ 𝑋 ∈ 𝑉 ∧ {𝑋} ∉ 𝐸) → (𝑋𝐶1) = ∅) |
25 | 15, 24 | pm2.61ian 811 | 1 ⊢ ({𝑋} ∉ 𝐸 → (𝑋𝐶1) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ∉ wnel 3091 ∀wral 3106 {crab 3110 ∅c0 4243 {csn 4525 ‘cfv 6324 (class class class)co 7135 1c1 10527 ℕcn 11625 Word cword 13857 〈“cs1 13940 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-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-s1 13941 df-clwwlk 27767 df-clwwlkn 27810 df-clwwlknon 27873 |
This theorem is referenced by: clwwlknon1sn 27885 clwwlknon1le1 27886 |
Copyright terms: Public domain | W3C validator |