uhgrsubgrself - Metamath Proof Explorer

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

Theorem uhgrsubgrself 29259

Description: A hypergraph is a subgraph of itself. (Contributed by AV, 17-Nov-2020.) (Proof shortened by AV, 21-Nov-2020.)

**Assertion**
Ref	Expression
uhgrsubgrself	⊢ (𝐺 ∈ UHGraph → 𝐺 SubGraph 𝐺)

**Proof of Theorem uhgrsubgrself**
Step	Hyp	Ref	Expression
1		ssid 3981	. . 3 ⊢ (Vtx‘𝐺) ⊆ (Vtx‘𝐺)
2		ssid 3981	. . 3 ⊢ (iEdg‘𝐺) ⊆ (iEdg‘𝐺)
3	1, 2	pm3.2i 470	. 2 ⊢ ((Vtx‘𝐺) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝐺) ⊆ (iEdg‘𝐺))
4		eqid 2735	. . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
5	4	uhgrfun 29045	. . 3 ⊢ (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺))
6		id 22	. . 3 ⊢ (𝐺 ∈ UHGraph → 𝐺 ∈ UHGraph)
7		eqid 2735	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
8	7, 7, 4, 4	uhgrissubgr 29254	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ Fun (iEdg‘𝐺) ∧ 𝐺 ∈ UHGraph) → (𝐺 SubGraph 𝐺 ↔ ((Vtx‘𝐺) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝐺) ⊆ (iEdg‘𝐺))))
9	5, 6, 8	mpd3an23 1465	. 2 ⊢ (𝐺 ∈ UHGraph → (𝐺 SubGraph 𝐺 ↔ ((Vtx‘𝐺) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝐺) ⊆ (iEdg‘𝐺))))
10	3, 9	mpbiri 258	1 ⊢ (𝐺 ∈ UHGraph → 𝐺 SubGraph 𝐺)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2108 ⊆ wss 3926 class class class wbr 5119 Fun wfun 6525 ‘cfv 6531 Vtxcvtx 28975 iEdgciedg 28976 UHGraphcuhgr 29035 SubGraph csubgr 29246

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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 ax-un 7729

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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-sbc 3766 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-edg 29027 df-uhgr 29037 df-subgr 29247

This theorem is referenced by: (None)

W3C validator