| 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 3454 | . . . . . 6 ⊢ 𝑔 ∈ V | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ V) |
| 5 | simprl 783 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → (Vtx‘𝑔) = 𝑉) | |
| 6 | simprr 785 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) | |
| 7 | simpl 488 | . . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝐺 ∈ UPGraph) | |
| 8 | 1, 2, 4, 5, 6, 7 | upgrspan 29883 | . . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ ((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴))) → 𝑔 ∈ UPGraph) |
| 9 | 8 | ex 418 | . . 3 ⊢ (𝐺 ∈ UPGraph → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 10 | 9 | alrimiv 1959 | . 2 ⊢ (𝐺 ∈ UPGraph → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = (𝐸 ↾ 𝐴)) → 𝑔 ∈ UPGraph)) |
| 11 | 1 | fvexi 6904 | . . 3 ⊢ 𝑉 ∈ V |
| 12 | 11 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → 𝑉 ∈ V) |
| 13 | 2 | fvexi 6904 | . . . 4 ⊢ 𝐸 ∈ V |
| 14 | 13 | resex 6020 | . . 3 ⊢ (𝐸 ↾ 𝐴) ∈ V |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝐺 ∈ UPGraph → (𝐸 ↾ 𝐴) ∈ V) |
| 16 | 10, 12, 15 | gropeld 29620 | 1 ⊢ (𝐺 ∈ UPGraph → 〈𝑉, (𝐸 ↾ 𝐴)〉 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 〈cop 4834 ↾ cres 5653 ‘cfv 6543 Vtxcvtx 29583 iEdgciedg 29584 UPGraphcupgr 29667 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-1st 8005 df-2nd 8006 df-vtx 29585 df-iedg 29586 df-edg 29635 df-uhgr 29645 df-upgr 29669 df-subgr 29858 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |