| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > umgrnloop2 | GIF version | ||
| Description: A multigraph has no loops. (Contributed by AV, 27-Oct-2020.) (Revised by AV, 30-Nov-2020.) |
| Ref | Expression |
|---|---|
| umgrnloop2 | ⊢ (𝐺 ∈ UMGraph → {𝑁, 𝑁} ∉ (Edg‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2206 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2206 | . . . . 5 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 3 | 1, 2 | umgrpredgv 15821 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ {𝑁, 𝑁} ∈ (Edg‘𝐺)) → (𝑁 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) |
| 4 | 3 | simpld 112 | . . 3 ⊢ ((𝐺 ∈ UMGraph ∧ {𝑁, 𝑁} ∈ (Edg‘𝐺)) → 𝑁 ∈ (Vtx‘𝐺)) |
| 5 | eqid 2206 | . . . 4 ⊢ 𝑁 = 𝑁 | |
| 6 | 2 | umgredgne 15824 | . . . 4 ⊢ ((𝐺 ∈ UMGraph ∧ {𝑁, 𝑁} ∈ (Edg‘𝐺)) → 𝑁 ≠ 𝑁) |
| 7 | eqneqall 2387 | . . . 4 ⊢ (𝑁 = 𝑁 → (𝑁 ≠ 𝑁 → ¬ 𝑁 ∈ (Vtx‘𝐺))) | |
| 8 | 5, 6, 7 | mpsyl 65 | . . 3 ⊢ ((𝐺 ∈ UMGraph ∧ {𝑁, 𝑁} ∈ (Edg‘𝐺)) → ¬ 𝑁 ∈ (Vtx‘𝐺)) |
| 9 | 4, 8 | pm2.65da 663 | . 2 ⊢ (𝐺 ∈ UMGraph → ¬ {𝑁, 𝑁} ∈ (Edg‘𝐺)) |
| 10 | df-nel 2473 | . 2 ⊢ ({𝑁, 𝑁} ∉ (Edg‘𝐺) ↔ ¬ {𝑁, 𝑁} ∈ (Edg‘𝐺)) | |
| 11 | 9, 10 | sylibr 134 | 1 ⊢ (𝐺 ∈ UMGraph → {𝑁, 𝑁} ∉ (Edg‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2177 ≠ wne 2377 ∉ wnel 2472 {cpr 3639 ‘cfv 5285 Vtxcvtx 15696 Edgcedg 15739 UMGraphcumgr 15773 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4173 ax-nul 4181 ax-pow 4229 ax-pr 4264 ax-un 4493 ax-setind 4598 ax-iinf 4649 ax-cnex 8046 ax-resscn 8047 ax-1cn 8048 ax-1re 8049 ax-icn 8050 ax-addcl 8051 ax-addrcl 8052 ax-mulcl 8053 ax-addcom 8055 ax-mulcom 8056 ax-addass 8057 ax-mulass 8058 ax-distr 8059 ax-i2m1 8060 ax-1rid 8062 ax-0id 8063 ax-rnegex 8064 ax-cnre 8066 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-if 3576 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-int 3895 df-br 4055 df-opab 4117 df-mpt 4118 df-tr 4154 df-id 4353 df-iord 4426 df-on 4428 df-suc 4431 df-iom 4652 df-xp 4694 df-rel 4695 df-cnv 4696 df-co 4697 df-dm 4698 df-rn 4699 df-res 4700 df-ima 4701 df-iota 5246 df-fun 5287 df-fn 5288 df-f 5289 df-f1 5290 df-fo 5291 df-f1o 5292 df-fv 5293 df-riota 5917 df-ov 5965 df-oprab 5966 df-mpo 5967 df-1st 6244 df-2nd 6245 df-1o 6520 df-2o 6521 df-er 6638 df-en 6846 df-sub 8275 df-inn 9067 df-2 9125 df-3 9126 df-4 9127 df-5 9128 df-6 9129 df-7 9130 df-8 9131 df-9 9132 df-n0 9326 df-dec 9535 df-ndx 12920 df-slot 12921 df-base 12923 df-edgf 15689 df-vtx 15698 df-iedg 15699 df-edg 15740 df-umgren 15775 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |