| 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 4039 | . . 3 ⊢ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 𝑉 ∖ {∅}) | |
| 2 | isupgr.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | isupgr.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | 2, 3 | upgrfn 28990 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 5 | 4 | ffvelcdmda 7038 | . . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 6 | 5 | 3impa 1109 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 7 | 1, 6 | sselid 3941 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅})) |
| 8 | eldifsni 4750 | . 2 ⊢ ((𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝐹) ≠ ∅) | |
| 9 | 7, 8 | syl 17 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 {crab 3402 ∖ cdif 3908 ∅c0 4292 𝒫 cpw 4559 {csn 4585 class class class wbr 5102 Fn wfn 6494 ‘cfv 6499 ≤ cle 11185 2c2 12217 ♯chash 14271 Vtxcvtx 28899 iEdgciedg 28900 UPGraphcupgr 28983 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pr 5382 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3403 df-v 3446 df-sbc 3751 df-dif 3914 df-un 3916 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-fv 6507 df-upgr 28985 |
| This theorem is referenced by: upgrex 28995 |
| Copyright terms: Public domain | W3C validator |