Theorem uhgrspan1 29388

Description: The induced subgraph 𝑆 of a hypergraph 𝐺 obtained by removing one vertex is actually a subgraph of 𝐺. A subgraph is called induced or spanned by a subset of vertices of a graph if it contains all edges of the original graph that join two vertices of the subgraph (see section I.1 in [Bollobas] p. 2 and section 1.1 in [Diestel] p. 4). (Contributed by AV, 19-Nov-2020.)

Hypotheses

Ref	Expression
uhgrspan1.v	⊢ 𝑉 = (Vtx‘𝐺)
uhgrspan1.i	⊢ 𝐼 = (iEdg‘𝐺)
uhgrspan1.f	⊢ 𝐹 = {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∉ (𝐼‘𝑖)}
uhgrspan1.s	⊢ 𝑆 = ⟨(𝑉 ∖ {𝑁}), (𝐼 ↾ 𝐹)⟩

Assertion

Ref	Expression
uhgrspan1	⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 SubGraph 𝐺)

Distinct variable groups:   𝑖,𝐼   𝑖,𝑁

Allowed substitution hints:   𝑆(𝑖)   𝐹(𝑖)   𝐺(𝑖)   𝑉(𝑖)

Proof of Theorem uhgrspan1

Dummy variables 𝑐 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difssd 4091	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (𝑉 ∖ {𝑁}) ⊆ 𝑉)
2		uhgrspan1.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
3		uhgrspan1.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
4		uhgrspan1.f	. . . 4 ⊢ 𝐹 = {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∉ (𝐼‘𝑖)}
5		uhgrspan1.s	. . . 4 ⊢ 𝑆 = ⟨(𝑉 ∖ {𝑁}), (𝐼 ↾ 𝐹)⟩
6	2, 3, 4, 5	uhgrspan1lem3 29387	. . 3 ⊢ (iEdg‘𝑆) = (𝐼 ↾ 𝐹)
7		resresdm 6199	. . 3 ⊢ ((iEdg‘𝑆) = (𝐼 ↾ 𝐹) → (iEdg‘𝑆) = (𝐼 ↾ dom (iEdg‘𝑆)))
8	6, 7	mp1i 13	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (iEdg‘𝑆) = (𝐼 ↾ dom (iEdg‘𝑆)))
9	3	uhgrfun 29151	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼)
10		fvelima 6907	. . . . . . 7 ⊢ ((Fun 𝐼 ∧ 𝑐 ∈ (𝐼 “ 𝐹)) → ∃𝑗 ∈ 𝐹 (𝐼‘𝑗) = 𝑐)
11	10	ex 412	. . . . . 6 ⊢ (Fun 𝐼 → (𝑐 ∈ (𝐼 “ 𝐹) → ∃𝑗 ∈ 𝐹 (𝐼‘𝑗) = 𝑐))
12	9, 11	syl 17	. . . . 5 ⊢ (𝐺 ∈ UHGraph → (𝑐 ∈ (𝐼 “ 𝐹) → ∃𝑗 ∈ 𝐹 (𝐼‘𝑗) = 𝑐))
13	12	adantr 480	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (𝑐 ∈ (𝐼 “ 𝐹) → ∃𝑗 ∈ 𝐹 (𝐼‘𝑗) = 𝑐))
14		eqidd 2738	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → 𝑁 = 𝑁)
15		fveq2 6842	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝐼‘𝑖) = (𝐼‘𝑗))
16	14, 15	neleq12d 3042	. . . . . . 7 ⊢ (𝑖 = 𝑗 → (𝑁 ∉ (𝐼‘𝑖) ↔ 𝑁 ∉ (𝐼‘𝑗)))
17	16, 4	elrab2 3651	. . . . . 6 ⊢ (𝑗 ∈ 𝐹 ↔ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗)))
18		fvexd 6857	. . . . . . . . 9 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗))) → (𝐼‘𝑗) ∈ V)
19	2, 3	uhgrss 29149	. . . . . . . . . 10 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑗 ∈ dom 𝐼) → (𝐼‘𝑗) ⊆ 𝑉)
20	19	ad2ant2r 748	. . . . . . . . 9 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗))) → (𝐼‘𝑗) ⊆ 𝑉)
21		simprr 773	. . . . . . . . 9 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗))) → 𝑁 ∉ (𝐼‘𝑗))
22		elpwdifsn 4747	. . . . . . . . 9 ⊢ (((𝐼‘𝑗) ∈ V ∧ (𝐼‘𝑗) ⊆ 𝑉 ∧ 𝑁 ∉ (𝐼‘𝑗)) → (𝐼‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
23	18, 20, 21, 22	syl3anc 1374	. . . . . . . 8 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗))) → (𝐼‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁}))
24		eleq1 2825	. . . . . . . . 9 ⊢ (𝑐 = (𝐼‘𝑗) → (𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁}) ↔ (𝐼‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
25	24	eqcoms 2745	. . . . . . . 8 ⊢ ((𝐼‘𝑗) = 𝑐 → (𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁}) ↔ (𝐼‘𝑗) ∈ 𝒫 (𝑉 ∖ {𝑁})))
26	23, 25	syl5ibrcom 247	. . . . . . 7 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗))) → ((𝐼‘𝑗) = 𝑐 → 𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁})))
27	26	ex 412	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐼 ∧ 𝑁 ∉ (𝐼‘𝑗)) → ((𝐼‘𝑗) = 𝑐 → 𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁}))))
28	17, 27	biimtrid 242	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (𝑗 ∈ 𝐹 → ((𝐼‘𝑗) = 𝑐 → 𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁}))))
29	28	rexlimdv 3137	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (∃𝑗 ∈ 𝐹 (𝐼‘𝑗) = 𝑐 → 𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁})))
30	13, 29	syld 47	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (𝑐 ∈ (𝐼 “ 𝐹) → 𝑐 ∈ 𝒫 (𝑉 ∖ {𝑁})))
31	30	ssrdv 3941	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 “ 𝐹) ⊆ 𝒫 (𝑉 ∖ {𝑁}))
32		opex 5419	. . . . 5 ⊢ ⟨(𝑉 ∖ {𝑁}), (𝐼 ↾ 𝐹)⟩ ∈ V
33	5, 32	eqeltri 2833	. . . 4 ⊢ 𝑆 ∈ V
34	33	a1i 11	. . 3 ⊢ (𝑁 ∈ 𝑉 → 𝑆 ∈ V)
35	2, 3, 4, 5	uhgrspan1lem2 29386	. . . . 5 ⊢ (Vtx‘𝑆) = (𝑉 ∖ {𝑁})
36	35	eqcomi 2746	. . . 4 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆)
37		eqid 2737	. . . 4 ⊢ (iEdg‘𝑆) = (iEdg‘𝑆)
38	6	rneqi 5894	. . . . 5 ⊢ ran (iEdg‘𝑆) = ran (𝐼 ↾ 𝐹)
39		edgval 29134	. . . . 5 ⊢ (Edg‘𝑆) = ran (iEdg‘𝑆)
40		df-ima 5645	. . . . 5 ⊢ (𝐼 “ 𝐹) = ran (𝐼 ↾ 𝐹)
41	38, 39, 40	3eqtr4ri 2771	. . . 4 ⊢ (𝐼 “ 𝐹) = (Edg‘𝑆)
42	36, 2, 37, 3, 41	issubgr 29356	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ∈ V) → (𝑆 SubGraph 𝐺 ↔ ((𝑉 ∖ {𝑁}) ⊆ 𝑉 ∧ (iEdg‘𝑆) = (𝐼 ↾ dom (iEdg‘𝑆)) ∧ (𝐼 “ 𝐹) ⊆ 𝒫 (𝑉 ∖ {𝑁}))))
43	34, 42	sylan2 594	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → (𝑆 SubGraph 𝐺 ↔ ((𝑉 ∖ {𝑁}) ⊆ 𝑉 ∧ (iEdg‘𝑆) = (𝐼 ↾ dom (iEdg‘𝑆)) ∧ (𝐼 “ 𝐹) ⊆ 𝒫 (𝑉 ∖ {𝑁}))))
44	1, 8, 31, 43	mpbir3and 1344	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑁 ∈ 𝑉) → 𝑆 SubGraph 𝐺)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ∉ wnel 3037  ∃wrex 3062  {crab 3401  Vcvv 3442   ∖ cdif 3900   ⊆ wss 3903  𝒫 cpw 4556  {csn 4582  ⟨cop 4588   class class class wbr 5100  dom cdm 5632  ran crn 5633   ↾ cres 5634   “ cima 5635  Fun wfun 6494  ‘cfv 6500  Vtxcvtx 29081  iEdgciedg 29082  Edgcedg 29132  UHGraphcuhgr 29141   SubGraph csubgr 29352

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-1st 7943  df-2nd 7944  df-vtx 29083  df-iedg 29084  df-edg 29133  df-uhgr 29143  df-subgr 29353

This theorem is referenced by: (None)