Theorem uhgrissubgr 27057

Description: The property of a hypergraph to be a subgraph. (Contributed by AV, 19-Nov-2020.)

Hypotheses

Ref	Expression
uhgrissubgr.v	⊢ 𝑉 = (Vtx‘𝑆)
uhgrissubgr.a	⊢ 𝐴 = (Vtx‘𝐺)
uhgrissubgr.i	⊢ 𝐼 = (iEdg‘𝑆)
uhgrissubgr.b	⊢ 𝐵 = (iEdg‘𝐺)

Assertion

Ref	Expression
uhgrissubgr	⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)))

Proof of Theorem uhgrissubgr

Dummy variable 𝑒 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		uhgrissubgr.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝑆)
2		uhgrissubgr.a	. . . 4 ⊢ 𝐴 = (Vtx‘𝐺)
3		uhgrissubgr.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝑆)
4		uhgrissubgr.b	. . . 4 ⊢ 𝐵 = (iEdg‘𝐺)
5		eqid 2821	. . . 4 ⊢ (Edg‘𝑆) = (Edg‘𝑆)
6	1, 2, 3, 4, 5	subgrprop2 27056	. . 3 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ (Edg‘𝑆) ⊆ 𝒫 𝑉))
7		3simpa 1144	. . 3 ⊢ ((𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵 ∧ (Edg‘𝑆) ⊆ 𝒫 𝑉) → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵))
8	6, 7	syl 17	. 2 ⊢ (𝑆 SubGraph 𝐺 → (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵))
9		simprl 769	. . . 4 ⊢ (((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) ∧ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)) → 𝑉 ⊆ 𝐴)
10		simp2 1133	. . . . . 6 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) → Fun 𝐵)
11		simpr 487	. . . . . 6 ⊢ ((𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵) → 𝐼 ⊆ 𝐵)
12		funssres 6398	. . . . . 6 ⊢ ((Fun 𝐵 ∧ 𝐼 ⊆ 𝐵) → (𝐵 ↾ dom 𝐼) = 𝐼)
13	10, 11, 12	syl2an 597	. . . . 5 ⊢ (((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) ∧ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)) → (𝐵 ↾ dom 𝐼) = 𝐼)
14	13	eqcomd 2827	. . . 4 ⊢ (((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) ∧ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)) → 𝐼 = (𝐵 ↾ dom 𝐼))
15		edguhgr 26914	. . . . . . . . 9 ⊢ ((𝑆 ∈ UHGraph ∧ 𝑒 ∈ (Edg‘𝑆)) → 𝑒 ∈ 𝒫 (Vtx‘𝑆))
16	15	ex 415	. . . . . . . 8 ⊢ (𝑆 ∈ UHGraph → (𝑒 ∈ (Edg‘𝑆) → 𝑒 ∈ 𝒫 (Vtx‘𝑆)))
17	1	pweqi 4557	. . . . . . . . 9 ⊢ 𝒫 𝑉 = 𝒫 (Vtx‘𝑆)
18	17	eleq2i 2904	. . . . . . . 8 ⊢ (𝑒 ∈ 𝒫 𝑉 ↔ 𝑒 ∈ 𝒫 (Vtx‘𝑆))
19	16, 18	syl6ibr 254	. . . . . . 7 ⊢ (𝑆 ∈ UHGraph → (𝑒 ∈ (Edg‘𝑆) → 𝑒 ∈ 𝒫 𝑉))
20	19	ssrdv 3973	. . . . . 6 ⊢ (𝑆 ∈ UHGraph → (Edg‘𝑆) ⊆ 𝒫 𝑉)
21	20	3ad2ant3 1131	. . . . 5 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) → (Edg‘𝑆) ⊆ 𝒫 𝑉)
22	21	adantr 483	. . . 4 ⊢ (((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) ∧ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)) → (Edg‘𝑆) ⊆ 𝒫 𝑉)
23	1, 2, 3, 4, 5	issubgr 27053	. . . . . 6 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ UHGraph) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ (Edg‘𝑆) ⊆ 𝒫 𝑉)))
24	23	3adant2 1127	. . . . 5 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ (Edg‘𝑆) ⊆ 𝒫 𝑉)))
25	24	adantr 483	. . . 4 ⊢ (((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) ∧ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 = (𝐵 ↾ dom 𝐼) ∧ (Edg‘𝑆) ⊆ 𝒫 𝑉)))
26	9, 14, 22, 25	mpbir3and 1338	. . 3 ⊢ (((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) ∧ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)) → 𝑆 SubGraph 𝐺)
27	26	ex 415	. 2 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) → ((𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵) → 𝑆 SubGraph 𝐺))
28	8, 27	impbid2 228	1 ⊢ ((𝐺 ∈ 𝑊 ∧ Fun 𝐵 ∧ 𝑆 ∈ UHGraph) → (𝑆 SubGraph 𝐺 ↔ (𝑉 ⊆ 𝐴 ∧ 𝐼 ⊆ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114   ⊆ wss 3936  𝒫 cpw 4539   class class class wbr 5066  dom cdm 5555   ↾ cres 5557  Fun wfun 6349  ‘cfv 6355  Vtxcvtx 26781  iEdgciedg 26782  Edgcedg 26832  UHGraphcuhgr 26841   SubGraph csubgr 27049

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-fv 6363  df-edg 26833  df-uhgr 26843  df-subgr 27050

This theorem is referenced by:  uhgrsubgrself  27062