| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isubgrsubgr | Structured version Visualization version GIF version | ||
| Description: An induced subgraph of a hypergraph is a subgraph of the hypergraph. (Contributed by AV, 14-May-2025.) |
| Ref | Expression |
|---|---|
| isubgrvtx.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| isubgrsubgr | ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐺 ISubGr 𝑆) SubGraph 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isubgrvtx.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | isubgrvtx 48791 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (Vtx‘(𝐺 ISubGr 𝑆)) = 𝑆) |
| 3 | simpr 490 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → 𝑆 ⊆ 𝑉) | |
| 4 | 2, 3 | eqsstrd 3968 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (Vtx‘(𝐺 ISubGr 𝑆)) ⊆ 𝑉) |
| 5 | eqid 2762 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 6 | 1, 5 | isubgriedg 48787 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘(𝐺 ISubGr 𝑆)) = ((iEdg‘𝐺) ↾ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆})) |
| 7 | resss 5998 | . . 3 ⊢ ((iEdg‘𝐺) ↾ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆}) ⊆ (iEdg‘𝐺) | |
| 8 | 6, 7 | eqsstrdi 3978 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘(𝐺 ISubGr 𝑆)) ⊆ (iEdg‘𝐺)) |
| 9 | simpl 488 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → 𝐺 ∈ UHGraph) | |
| 10 | 5 | uhgrfun 29531 | . . . 4 ⊢ (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺)) |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → Fun (iEdg‘𝐺)) |
| 12 | 1 | isubgruhgr 48792 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐺 ISubGr 𝑆) ∈ UHGraph) |
| 13 | eqid 2762 | . . . 4 ⊢ (Vtx‘(𝐺 ISubGr 𝑆)) = (Vtx‘(𝐺 ISubGr 𝑆)) | |
| 14 | eqid 2762 | . . . 4 ⊢ (iEdg‘(𝐺 ISubGr 𝑆)) = (iEdg‘(𝐺 ISubGr 𝑆)) | |
| 15 | 13, 1, 14, 5 | uhgrissubgr 29743 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ Fun (iEdg‘𝐺) ∧ (𝐺 ISubGr 𝑆) ∈ UHGraph) → ((𝐺 ISubGr 𝑆) SubGraph 𝐺 ↔ ((Vtx‘(𝐺 ISubGr 𝑆)) ⊆ 𝑉 ∧ (iEdg‘(𝐺 ISubGr 𝑆)) ⊆ (iEdg‘𝐺)))) |
| 16 | 9, 11, 12, 15 | syl3anc 1398 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → ((𝐺 ISubGr 𝑆) SubGraph 𝐺 ↔ ((Vtx‘(𝐺 ISubGr 𝑆)) ⊆ 𝑉 ∧ (iEdg‘(𝐺 ISubGr 𝑆)) ⊆ (iEdg‘𝐺)))) |
| 17 | 4, 8, 16 | mpbir2and 726 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐺 ISubGr 𝑆) SubGraph 𝐺) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3414 ⊆ wss 3902 class class class wbr 5107 dom cdm 5659 ↾ cres 5661 Fun wfun 6531 ‘cfv 6537 (class class class)co 7417 Vtxcvtx 29461 iEdgciedg 29462 UHGraphcuhgr 29521 SubGraph csubgr 29735 ISubGr cisubgr 48784 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-vtx 29463 df-iedg 29464 df-edg 29513 df-uhgr 29523 df-subgr 29736 df-isubgr 48785 |
| This theorem is used by: isubgrupgr 48794 isubgrumgr 48795 isubgrusgr 48796 |
| Copyright terms: Public domain | W3C validator |