| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > edgumgren | GIF version | ||
| Description: Properties of an edge of a multigraph. (Contributed by AV, 25-Nov-2020.) |
| Ref | Expression |
|---|---|
| edgumgren | ⊢ ((𝐺 ∈ UMGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → (𝐸 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝐸 ≈ 2o)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | edgvalg 16300 | . . . 4 ⊢ (𝐺 ∈ UMGraph → (Edg‘𝐺) = ran (iEdg‘𝐺)) | |
| 2 | eqid 2238 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 3 | eqid 2238 | . . . . . 6 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 4 | 2, 3 | umgrfen 16348 | . . . . 5 ⊢ (𝐺 ∈ UMGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}) |
| 5 | 4 | frnd 5543 | . . . 4 ⊢ (𝐺 ∈ UMGraph → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}) |
| 6 | 1, 5 | eqsstrd 3284 | . . 3 ⊢ (𝐺 ∈ UMGraph → (Edg‘𝐺) ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}) |
| 7 | 6 | sselda 3248 | . 2 ⊢ ((𝐺 ∈ UMGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → 𝐸 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}) |
| 8 | breq1 4133 | . . 3 ⊢ (𝑥 = 𝐸 → (𝑥 ≈ 2o ↔ 𝐸 ≈ 2o)) | |
| 9 | 8 | elrab 2982 | . 2 ⊢ (𝐸 ∈ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o} ↔ (𝐸 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝐸 ≈ 2o)) |
| 10 | 7, 9 | sylib 122 | 1 ⊢ ((𝐺 ∈ UMGraph ∧ 𝐸 ∈ (Edg‘𝐺)) → (𝐸 ∈ 𝒫 (Vtx‘𝐺) ∧ 𝐸 ≈ 2o)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∈ wcel 2209 {crab 2532 𝒫 cpw 3688 class class class wbr 4130 dom cdm 4774 ran crn 4775 ‘cfv 5377 2oc2o 6681 ≈ cen 7020 Vtxcvtx 16253 iEdgciedg 16254 Edgcedg 16298 UMGraphcumgr 16333 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fo 5383 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-sub 8499 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-5 9366 df-6 9367 df-7 9368 df-8 9369 df-9 9370 df-n0 9564 df-dec 9778 df-ndx 13355 df-slot 13356 df-base 13358 df-edgf 16246 df-vtx 16255 df-iedg 16256 df-edg 16299 df-umgren 16335 |
| This theorem is used by: umgredg 16386 umgrpredgv 16388 umgredgne 16391 umgredgnlp 16393 |
| Copyright terms: Public domain | W3C validator |