![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > umgr2adedgwlklem | Structured version Visualization version GIF version |
Description: Lemma for umgr2adedgwlk 29978, umgr2adedgspth 29981, etc. (Contributed by Alexander van der Vekens, 1-Feb-2018.) (Revised by AV, 29-Jan-2021.) |
Ref | Expression |
---|---|
umgr2adedgwlk.e | ⊢ 𝐸 = (Edg‘𝐺) |
Ref | Expression |
---|---|
umgr2adedgwlklem | ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgr2adedgwlk.e | . . . . . 6 ⊢ 𝐸 = (Edg‘𝐺) | |
2 | 1 | umgredgne 29180 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸) → 𝐴 ≠ 𝐵) |
3 | 2 | ex 412 | . . . 4 ⊢ (𝐺 ∈ UMGraph → ({𝐴, 𝐵} ∈ 𝐸 → 𝐴 ≠ 𝐵)) |
4 | 1 | umgredgne 29180 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐵, 𝐶} ∈ 𝐸) → 𝐵 ≠ 𝐶) |
5 | 4 | ex 412 | . . . 4 ⊢ (𝐺 ∈ UMGraph → ({𝐵, 𝐶} ∈ 𝐸 → 𝐵 ≠ 𝐶)) |
6 | 3, 5 | anim12d 608 | . . 3 ⊢ (𝐺 ∈ UMGraph → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶))) |
7 | 6 | 3impib 1116 | . 2 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) |
8 | eqid 2740 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
9 | 8, 1 | umgrpredgv 29175 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸) → (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺))) |
10 | 9 | simpld 494 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸) → 𝐴 ∈ (Vtx‘𝐺)) |
11 | 10 | 3adant3 1132 | . . 3 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → 𝐴 ∈ (Vtx‘𝐺)) |
12 | 8, 1 | umgrpredgv 29175 | . . . . 5 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐵, 𝐶} ∈ 𝐸) → (𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺))) |
13 | 12 | simpld 494 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐵, 𝐶} ∈ 𝐸) → 𝐵 ∈ (Vtx‘𝐺)) |
14 | 13 | 3adant2 1131 | . . 3 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → 𝐵 ∈ (Vtx‘𝐺)) |
15 | 12 | simprd 495 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐵, 𝐶} ∈ 𝐸) → 𝐶 ∈ (Vtx‘𝐺)) |
16 | 15 | 3adant2 1131 | . . 3 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → 𝐶 ∈ (Vtx‘𝐺)) |
17 | 11, 14, 16 | 3jca 1128 | . 2 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺))) |
18 | 7, 17 | jca 511 | 1 ⊢ ((𝐺 ∈ UMGraph ∧ {𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺) ∧ 𝐶 ∈ (Vtx‘𝐺)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 {cpr 4650 ‘cfv 6573 Vtxcvtx 29031 Edgcedg 29082 UMGraphcumgr 29116 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-oadd 8526 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-dju 9970 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568 df-hash 14380 df-edg 29083 df-umgr 29118 |
This theorem is referenced by: umgr2adedgwlk 29978 umgr2adedgwlkon 29979 umgr2adedgwlkonALT 29980 umgr2adedgspth 29981 umgr2wlkon 29983 |
Copyright terms: Public domain | W3C validator |