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

Theorem subuhgr 26071
 Description: A subgraph of a hypergraph is a hypergraph. (Contributed by AV, 16-Nov-2020.) (Proof shortened by AV, 21-Nov-2020.)
Assertion
Ref Expression
subuhgr ((𝐺 ∈ UHGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UHGraph )

Proof of Theorem subuhgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2621 . . . 4 (Vtx‘𝑆) = (Vtx‘𝑆)
2 eqid 2621 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
3 eqid 2621 . . . 4 (iEdg‘𝑆) = (iEdg‘𝑆)
4 eqid 2621 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
5 eqid 2621 . . . 4 (Edg‘𝑆) = (Edg‘𝑆)
61, 2, 3, 4, 5subgrprop2 26059 . . 3 (𝑆 SubGraph 𝐺 → ((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)))
7 subgruhgrfun 26067 . . . . . . . . 9 ((𝐺 ∈ UHGraph ∧ 𝑆 SubGraph 𝐺) → Fun (iEdg‘𝑆))
87ancoms 469 . . . . . . . 8 ((𝑆 SubGraph 𝐺𝐺 ∈ UHGraph ) → Fun (iEdg‘𝑆))
98adantl 482 . . . . . . 7 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → Fun (iEdg‘𝑆))
10 funfn 5877 . . . . . . 7 (Fun (iEdg‘𝑆) ↔ (iEdg‘𝑆) Fn dom (iEdg‘𝑆))
119, 10sylib 208 . . . . . 6 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → (iEdg‘𝑆) Fn dom (iEdg‘𝑆))
12 simplrr 800 . . . . . . . . 9 (((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) ∧ 𝑥 ∈ dom (iEdg‘𝑆)) → 𝐺 ∈ UHGraph )
13 simplrl 799 . . . . . . . . 9 (((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) ∧ 𝑥 ∈ dom (iEdg‘𝑆)) → 𝑆 SubGraph 𝐺)
14 simpr 477 . . . . . . . . 9 (((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) ∧ 𝑥 ∈ dom (iEdg‘𝑆)) → 𝑥 ∈ dom (iEdg‘𝑆))
151, 3, 12, 13, 14subgruhgredgd 26069 . . . . . . . 8 (((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) ∧ 𝑥 ∈ dom (iEdg‘𝑆)) → ((iEdg‘𝑆)‘𝑥) ∈ (𝒫 (Vtx‘𝑆) ∖ {∅}))
1615ralrimiva 2960 . . . . . . 7 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → ∀𝑥 ∈ dom (iEdg‘𝑆)((iEdg‘𝑆)‘𝑥) ∈ (𝒫 (Vtx‘𝑆) ∖ {∅}))
17 fnfvrnss 6345 . . . . . . 7 (((iEdg‘𝑆) Fn dom (iEdg‘𝑆) ∧ ∀𝑥 ∈ dom (iEdg‘𝑆)((iEdg‘𝑆)‘𝑥) ∈ (𝒫 (Vtx‘𝑆) ∖ {∅})) → ran (iEdg‘𝑆) ⊆ (𝒫 (Vtx‘𝑆) ∖ {∅}))
1811, 16, 17syl2anc 692 . . . . . 6 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → ran (iEdg‘𝑆) ⊆ (𝒫 (Vtx‘𝑆) ∖ {∅}))
19 df-f 5851 . . . . . 6 ((iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅}) ↔ ((iEdg‘𝑆) Fn dom (iEdg‘𝑆) ∧ ran (iEdg‘𝑆) ⊆ (𝒫 (Vtx‘𝑆) ∖ {∅})))
2011, 18, 19sylanbrc 697 . . . . 5 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → (iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅}))
21 subgrv 26055 . . . . . . . 8 (𝑆 SubGraph 𝐺 → (𝑆 ∈ V ∧ 𝐺 ∈ V))
221, 3isuhgr 25851 . . . . . . . . 9 (𝑆 ∈ V → (𝑆 ∈ UHGraph ↔ (iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅})))
2322adantr 481 . . . . . . . 8 ((𝑆 ∈ V ∧ 𝐺 ∈ V) → (𝑆 ∈ UHGraph ↔ (iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅})))
2421, 23syl 17 . . . . . . 7 (𝑆 SubGraph 𝐺 → (𝑆 ∈ UHGraph ↔ (iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅})))
2524adantr 481 . . . . . 6 ((𝑆 SubGraph 𝐺𝐺 ∈ UHGraph ) → (𝑆 ∈ UHGraph ↔ (iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅})))
2625adantl 482 . . . . 5 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → (𝑆 ∈ UHGraph ↔ (iEdg‘𝑆):dom (iEdg‘𝑆)⟶(𝒫 (Vtx‘𝑆) ∖ {∅})))
2720, 26mpbird 247 . . . 4 ((((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) ∧ (𝑆 SubGraph 𝐺𝐺 ∈ UHGraph )) → 𝑆 ∈ UHGraph )
2827ex 450 . . 3 (((Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (iEdg‘𝑆) ⊆ (iEdg‘𝐺) ∧ (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆)) → ((𝑆 SubGraph 𝐺𝐺 ∈ UHGraph ) → 𝑆 ∈ UHGraph ))
296, 28syl 17 . 2 (𝑆 SubGraph 𝐺 → ((𝑆 SubGraph 𝐺𝐺 ∈ UHGraph ) → 𝑆 ∈ UHGraph ))
3029anabsi8 860 1 ((𝐺 ∈ UHGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UHGraph )
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   ∈ wcel 1987  ∀wral 2907  Vcvv 3186   ∖ cdif 3552   ⊆ wss 3555  ∅c0 3891  𝒫 cpw 4130  {csn 4148   class class class wbr 4613  dom cdm 5074  ran crn 5075  Fun wfun 5841   Fn wfn 5842  ⟶wf 5843  ‘cfv 5847  Vtxcvtx 25774  iEdgciedg 25775  Edgcedg 25839   UHGraph cuhgr 25847   SubGraph csubgr 26052 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867  ax-un 6902 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-fv 5855  df-edg 25840  df-uhgr 25849  df-subgr 26053 This theorem is referenced by:  uhgrspan  26077
 Copyright terms: Public domain W3C validator