| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > upgrn0 | Structured version Visualization version GIF version | ||
| Description: An edge is a nonempty subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.) |
| Ref | Expression |
|---|---|
| isupgr.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| isupgr.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| upgrn0 | ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrab2 4031 | . . 3 ⊢ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 𝑉 ∖ {∅}) | |
| 2 | isupgr.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | isupgr.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | 2, 3 | upgrfn 29245 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 5 | 4 | ffvelcdmda 7060 | . . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 6 | 5 | 3impa 1121 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 7 | 1, 6 | sselid 3932 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅})) |
| 8 | eldifsni 4747 | . 2 ⊢ ((𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝐹) ≠ ∅) | |
| 9 | 7, 8 | syl 17 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 {crab 3413 ∖ cdif 3899 ∅c0 4283 𝒫 cpw 4552 {csn 4579 class class class wbr 5097 Fn wfn 6511 ‘cfv 6516 ≤ cle 11211 2c2 12266 ♯chash 14337 Vtxcvtx 29154 iEdgciedg 29155 UPGraphcupgr 29238 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-fv 6524 df-upgr 29240 |
| This theorem is referenced by: upgrex 29250 |
| Copyright terms: Public domain | W3C validator |