| 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 48343 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (Vtx‘(𝐺 ISubGr 𝑆)) = 𝑆) |
| 3 | simpr 484 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → 𝑆 ⊆ 𝑉) | |
| 4 | 2, 3 | eqsstrd 3956 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (Vtx‘(𝐺 ISubGr 𝑆)) ⊆ 𝑉) |
| 5 | eqid 2736 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 6 | 1, 5 | isubgriedg 48339 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘(𝐺 ISubGr 𝑆)) = ((iEdg‘𝐺) ↾ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆})) |
| 7 | resss 5966 | . . 3 ⊢ ((iEdg‘𝐺) ↾ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆}) ⊆ (iEdg‘𝐺) | |
| 8 | 6, 7 | eqsstrdi 3966 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘(𝐺 ISubGr 𝑆)) ⊆ (iEdg‘𝐺)) |
| 9 | simpl 482 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → 𝐺 ∈ UHGraph) | |
| 10 | 5 | uhgrfun 29135 | . . . 4 ⊢ (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺)) |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → Fun (iEdg‘𝐺)) |
| 12 | 1 | isubgruhgr 48344 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐺 ISubGr 𝑆) ∈ UHGraph) |
| 13 | eqid 2736 | . . . 4 ⊢ (Vtx‘(𝐺 ISubGr 𝑆)) = (Vtx‘(𝐺 ISubGr 𝑆)) | |
| 14 | eqid 2736 | . . . 4 ⊢ (iEdg‘(𝐺 ISubGr 𝑆)) = (iEdg‘(𝐺 ISubGr 𝑆)) | |
| 15 | 13, 1, 14, 5 | uhgrissubgr 29344 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ Fun (iEdg‘𝐺) ∧ (𝐺 ISubGr 𝑆) ∈ UHGraph) → ((𝐺 ISubGr 𝑆) SubGraph 𝐺 ↔ ((Vtx‘(𝐺 ISubGr 𝑆)) ⊆ 𝑉 ∧ (iEdg‘(𝐺 ISubGr 𝑆)) ⊆ (iEdg‘𝐺)))) |
| 16 | 9, 11, 12, 15 | syl3anc 1374 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → ((𝐺 ISubGr 𝑆) SubGraph 𝐺 ↔ ((Vtx‘(𝐺 ISubGr 𝑆)) ⊆ 𝑉 ∧ (iEdg‘(𝐺 ISubGr 𝑆)) ⊆ (iEdg‘𝐺)))) |
| 17 | 4, 8, 16 | mpbir2and 714 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐺 ISubGr 𝑆) SubGraph 𝐺) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3389 ⊆ wss 3889 class class class wbr 5085 dom cdm 5631 ↾ cres 5633 Fun wfun 6492 ‘cfv 6498 (class class class)co 7367 Vtxcvtx 29065 iEdgciedg 29066 UHGraphcuhgr 29125 SubGraph csubgr 29336 ISubGr cisubgr 48336 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 df-vtx 29067 df-iedg 29068 df-edg 29117 df-uhgr 29127 df-subgr 29337 df-isubgr 48337 |
| This theorem is referenced by: isubgrupgr 48346 isubgrumgr 48347 isubgrusgr 48348 |
| Copyright terms: Public domain | W3C validator |