uhgrn0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > uhgrn0		Structured version Visualization version GIF version

Theorem uhgrn0 26860

Description: An edge is a nonempty subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 15-Dec-2020.)

**Hypothesis**
Ref	Expression
uhgrfun.e	⊢ 𝐸 = (iEdg‘𝐺)

**Assertion**
Ref	Expression
uhgrn0	⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ≠ ∅)

**Proof of Theorem uhgrn0**
Step	Hyp	Ref	Expression
1		eqid 2798	. . . . . . 7 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		uhgrfun.e	. . . . . . 7 ⊢ 𝐸 = (iEdg‘𝐺)
3	1, 2	uhgrf 26855	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
4		fndm 6425	. . . . . . 7 ⊢ (𝐸 Fn 𝐴 → dom 𝐸 = 𝐴)
5	4	feq2d 6473	. . . . . 6 ⊢ (𝐸 Fn 𝐴 → (𝐸:dom 𝐸⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ 𝐸:𝐴⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
6	3, 5	syl5ibcom 248	. . . . 5 ⊢ (𝐺 ∈ UHGraph → (𝐸 Fn 𝐴 → 𝐸:𝐴⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
7	6	imp 410	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
8	7	ffvelrnda 6828	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}))
9	8	3impa 1107	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}))
10		eldifsni 4683	. 2 ⊢ ((𝐸‘𝐹) ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → (𝐸‘𝐹) ≠ ∅)
11	9, 10	syl 17	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ≠ ∅)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∖ cdif 3878 ∅c0 4243 𝒫 cpw 4497 {csn 4525 dom cdm 5519 Fn wfn 6319 ⟶wf 6320 ‘cfv 6324 Vtxcvtx 26789 iEdgciedg 26790 UHGraphcuhgr 26849

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fv 6332 df-uhgr 26851

This theorem is referenced by: lpvtx 26861 subgruhgredgd 27074

W3C validator