| 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 3467 | . . . . . 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 29583 | . . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ UPGraph) |
| 9 | 8 | ex 417 | . . 3 ⊢ (𝐺 ∈ UPGraph → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 10 | 9 | alrimiv 1954 | . 2 ⊢ (𝐺 ∈ UPGraph → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 11 | 1 | fvexi 6896 | . . 3 ⊢ 𝑉 ∈ V |
| 12 | 11 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → 𝑉 ∈ V) |
| 13 | 2 | fvexi 6896 | . . . 4 ⊢ 𝐸 ∈ V |
| 14 | 13 | resex 6029 | . . 3 ⊢ (𝐸 ↾ 𝐴) ∈ V |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → (𝐸 ↾ 𝐴) ∈ V) |
| 16 | 10, 12, 15 | gropeld 29323 | 1 ⊢ (𝐺 ∈ UPGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 〈cop 4600 ↾ cres 5664 ‘cfv 6537 Vtxcvtx 29286 iEdgciedg 29287 UPGraphcupgr 29370 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-1st 7985 df-2nd 7986 df-vtx 29288 df-iedg 29289 df-edg 29338 df-uhgr 29348 df-upgr 29372 df-subgr 29558 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |