| 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 3451 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ V) |
| 5 | simprl 770 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → (Vtx‘𝑔) = 𝑉) | |
| 6 | simprr 772 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) | |
| 7 | simpl 482 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝐺 ∈ UPGraph) | |
| 8 | 1, 2, 4, 5, 6, 7 | upgrspan 29220 | . . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ UPGraph) |
| 9 | 8 | ex 412 | . . 3 ⊢ (𝐺 ∈ UPGraph → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 10 | 9 | alrimiv 1927 | . 2 ⊢ (𝐺 ∈ UPGraph → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 11 | 1 | fvexi 6872 | . . 3 ⊢ 𝑉 ∈ V |
| 12 | 11 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → 𝑉 ∈ V) |
| 13 | 2 | fvexi 6872 | . . . 4 ⊢ 𝐸 ∈ V |
| 14 | 13 | resex 6000 | . . 3 ⊢ (𝐸 ↾ 𝐴) ∈ V |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → (𝐸 ↾ 𝐴) ∈ V) |
| 16 | 10, 12, 15 | gropeld 28960 | 1 ⊢ (𝐺 ∈ UPGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3447 〈cop 4595 ↾ cres 5640 ‘cfv 6511 Vtxcvtx 28923 iEdgciedg 28924 UPGraphcupgr 29007 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-fv 6519 df-1st 7968 df-2nd 7969 df-vtx 28925 df-iedg 28926 df-edg 28975 df-uhgr 28985 df-upgr 29009 df-subgr 29195 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |