| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > upgrspanop | Structured version Visualization version GIF version | ||
| Description: A spanning subgraph of a pseudograph represented by an ordered pair is a pseudograph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 13-Oct-2020.) |
| Ref | Expression |
|---|---|
| uhgrspanop.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| uhgrspanop.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| upgrspanop | ⊢ (𝐺 ∈ UPGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uhgrspanop.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | uhgrspanop.e | . . . . 5 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | vex 3459 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ V) |
| 5 | simprl 782 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → (Vtx‘𝑔) = 𝑉) | |
| 6 | simprr 784 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) | |
| 7 | simpl 487 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝐺 ∈ UPGraph) | |
| 8 | 1, 2, 4, 5, 6, 7 | upgrspan 29643 | . . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ UPGraph) |
| 9 | 8 | ex 417 | . . 3 ⊢ (𝐺 ∈ UPGraph → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 10 | 9 | alrimiv 1957 | . 2 ⊢ (𝐺 ∈ UPGraph → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 11 | 1 | fvexi 6895 | . . 3 ⊢ 𝑉 ∈ V |
| 12 | 11 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → 𝑉 ∈ V) |
| 13 | 2 | fvexi 6895 | . . . 4 ⊢ 𝐸 ∈ V |
| 14 | 13 | resex 6028 | . . 3 ⊢ (𝐸 ↾ 𝐴) ∈ V |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → (𝐸 ↾ 𝐴) ∈ V) |
| 16 | 10, 12, 15 | gropeld 29383 | 1 ⊢ (𝐺 ∈ UPGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 〈cop 4595 ↾ cres 5663 ‘cfv 6536 Vtxcvtx 29346 iEdgciedg 29347 UPGraphcupgr 29430 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-1st 7982 df-2nd 7983 df-vtx 29348 df-iedg 29349 df-edg 29398 df-uhgr 29408 df-upgr 29432 df-subgr 29618 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |