| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wwlks2onsym | Structured version Visualization version GIF version | ||
| Description: There is a walk of length 2 from one vertex to another vertex iff there is a walk of length 2 from the other vertex to the first vertex. (Contributed by AV, 7-Jan-2022.) |
| Ref | Expression |
|---|---|
| elwwlks2on.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| wwlks2onsym | ⊢ ((𝐺 ∈ UMGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ↔ 〈“𝐶𝐵𝐴”〉 ∈ (𝐶(2 WWalksNOn 𝐺)𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elwwlks2on.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | eqid 2765 | . . 3 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 3 | 1, 2 | umgrwwlks2on 30377 | . 2 ⊢ ((𝐺 ∈ UMGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ↔ ({𝐴, 𝐵} ∈ (Edg‘𝐺) ∧ {𝐵, 𝐶} ∈ (Edg‘𝐺)))) |
| 4 | 3anrev 1118 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ (𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉)) | |
| 5 | 1, 2 | umgrwwlks2on 30377 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ (𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉)) → (〈“𝐶𝐵𝐴”〉 ∈ (𝐶(2 WWalksNOn 𝐺)𝐴) ↔ ({𝐶, 𝐵} ∈ (Edg‘𝐺) ∧ {𝐵, 𝐴} ∈ (Edg‘𝐺)))) |
| 6 | 4, 5 | sylan2b 606 | . . 3 ⊢ ((𝐺 ∈ UMGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐶𝐵𝐴”〉 ∈ (𝐶(2 WWalksNOn 𝐺)𝐴) ↔ ({𝐶, 𝐵} ∈ (Edg‘𝐺) ∧ {𝐵, 𝐴} ∈ (Edg‘𝐺)))) |
| 7 | prcom 4700 | . . . . 5 ⊢ {𝐶, 𝐵} = {𝐵, 𝐶} | |
| 8 | 7 | eleq1i 2856 | . . . 4 ⊢ ({𝐶, 𝐵} ∈ (Edg‘𝐺) ↔ {𝐵, 𝐶} ∈ (Edg‘𝐺)) |
| 9 | prcom 4700 | . . . . 5 ⊢ {𝐵, 𝐴} = {𝐴, 𝐵} | |
| 10 | 9 | eleq1i 2856 | . . . 4 ⊢ ({𝐵, 𝐴} ∈ (Edg‘𝐺) ↔ {𝐴, 𝐵} ∈ (Edg‘𝐺)) |
| 11 | 8, 10 | anbi12ci 641 | . . 3 ⊢ (({𝐶, 𝐵} ∈ (Edg‘𝐺) ∧ {𝐵, 𝐴} ∈ (Edg‘𝐺)) ↔ ({𝐴, 𝐵} ∈ (Edg‘𝐺) ∧ {𝐵, 𝐶} ∈ (Edg‘𝐺))) |
| 12 | 6, 11 | bitr2di 291 | . 2 ⊢ ((𝐺 ∈ UMGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (({𝐴, 𝐵} ∈ (Edg‘𝐺) ∧ {𝐵, 𝐶} ∈ (Edg‘𝐺)) ↔ 〈“𝐶𝐵𝐴”〉 ∈ (𝐶(2 WWalksNOn 𝐺)𝐴))) |
| 13 | 3, 12 | bitrd 282 | 1 ⊢ ((𝐺 ∈ UMGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 ∈ (𝐴(2 WWalksNOn 𝐺)𝐶) ↔ 〈“𝐶𝐵𝐴”〉 ∈ (𝐶(2 WWalksNOn 𝐺)𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 {cpr 4593 ‘cfv 6540 (class class class)co 7419 2c2 12312 〈“cs3 14905 Vtxcvtx 29403 Edgcedg 29454 UMGraphcumgr 29488 WWalksNOn cwwlksnon 30245 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-ac2 10462 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-oadd 8463 df-er 8700 df-map 8832 df-pm 8833 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-dju 9903 df-card 9941 df-ac 10116 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-3 12321 df-n0 12522 df-xnn0 12595 df-z 12609 df-uz 12881 df-fz 13554 df-fzo 13702 df-hash 14387 df-word 14571 df-concat 14628 df-s1 14655 df-s2 14911 df-s3 14912 df-edg 29455 df-uhgr 29465 df-upgr 29489 df-umgr 29490 df-wlks 30009 df-wwlks 30248 df-wwlksn 30249 df-wwlksnon 30250 |
| This theorem is used by: frgr2wwlkeqm 30755 |
| Copyright terms: Public domain | W3C validator |