| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > usgr0e | GIF version | ||
| Description: The empty graph, with vertices but no edges, is a simple graph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.) (Proof shortened by AV, 25-Nov-2020.) |
| Ref | Expression |
|---|---|
| usgr0e.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| usgr0e.e | ⊢ (𝜑 → (iEdg‘𝐺) = ∅) |
| Ref | Expression |
|---|---|
| usgr0e | ⊢ (𝜑 → 𝐺 ∈ USGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgr0e.e | . . 3 ⊢ (𝜑 → (iEdg‘𝐺) = ∅) | |
| 2 | 1 | f10d 5675 | . 2 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o}) |
| 3 | usgr0e.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 4 | eqid 2238 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 5 | eqid 2238 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 6 | 4, 5 | isusgren 16411 | . . 3 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})) |
| 7 | 3, 6 | syl 14 | . 2 ⊢ (𝜑 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})) |
| 8 | 2, 7 | mpbird 167 | 1 ⊢ (𝜑 → 𝐺 ∈ USGraph) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 105 = wceq 1402 ∈ wcel 2209 {crab 2532 ∅c0 3520 𝒫 cpw 3688 class class class wbr 4130 dom cdm 4774 –1-1→wf1 5374 ‘cfv 5377 2oc2o 6681 ≈ cen 7020 Vtxcvtx 16265 iEdgciedg 16266 USGraphcusgr 16407 |
| 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-nul 4259 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-nul 3521 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-f1 5382 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 9306 df-2 9364 df-3 9365 df-4 9366 df-5 9367 df-6 9368 df-7 9369 df-8 9370 df-9 9371 df-n0 9566 df-dec 9780 df-ndx 13357 df-slot 13358 df-base 13360 df-edgf 16258 df-vtx 16267 df-iedg 16268 df-usgren 16409 |
| This theorem is used by: usgr0vb 16486 uhgr0vusgr 16491 usgr0eop 16495 edg0usgr 16500 griedg0ssusgr 16504 |
| Copyright terms: Public domain | W3C validator |