![]() |
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 4076 | . . 3 ⊢ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 𝑉 ∖ {∅}) | |
2 | isupgr.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
3 | isupgr.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
4 | 2, 3 | upgrfn 28614 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
5 | 4 | ffvelcdmda 7085 | . . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
6 | 5 | 3impa 1108 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
7 | 1, 6 | sselid 3979 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅})) |
8 | eldifsni 4792 | . 2 ⊢ ((𝐸‘𝐹) ∈ (𝒫 𝑉 ∖ {∅}) → (𝐸‘𝐹) ≠ ∅) | |
9 | 7, 8 | syl 17 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 {crab 3430 ∖ cdif 3944 ∅c0 4321 𝒫 cpw 4601 {csn 4627 class class class wbr 5147 Fn wfn 6537 ‘cfv 6542 ≤ cle 11253 2c2 12271 ♯chash 14294 Vtxcvtx 28523 iEdgciedg 28524 UPGraphcupgr 28607 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-sbc 3777 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-fv 6550 df-upgr 28609 |
This theorem is referenced by: upgrex 28619 |
Copyright terms: Public domain | W3C validator |