Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > upgr0eopALT | Structured version Visualization version GIF version |
Description: Alternate proof of upgr0eop 27529, using the general theorem gropeld 27448 to transform a theorem for an arbitrary representation of a graph into a theorem for a graph represented as ordered pair. This general approach causes some overhead, which makes the proof longer than necessary (see proof of upgr0eop 27529). (Contributed by AV, 11-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
upgr0eopALT | ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ∅〉 ∈ UPGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3441 | . . . . . 6 ⊢ 𝑔 ∈ V | |
2 | 1 | a1i 11 | . . . . 5 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ V) |
3 | simpr 486 | . . . . 5 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → (iEdg‘𝑔) = ∅) | |
4 | 2, 3 | upgr0e 27526 | . . . 4 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph) |
5 | 4 | ax-gen 1795 | . . 3 ⊢ ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph) |
6 | 5 | a1i 11 | . 2 ⊢ (𝑉 ∈ 𝑊 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)) |
7 | id 22 | . 2 ⊢ (𝑉 ∈ 𝑊 → 𝑉 ∈ 𝑊) | |
8 | 0ex 5240 | . . 3 ⊢ ∅ ∈ V | |
9 | 8 | a1i 11 | . 2 ⊢ (𝑉 ∈ 𝑊 → ∅ ∈ V) |
10 | 6, 7, 9 | gropeld 27448 | 1 ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ∅〉 ∈ UPGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∀wal 1537 = wceq 1539 ∈ wcel 2104 Vcvv 3437 ∅c0 4262 〈cop 4571 ‘cfv 6458 Vtxcvtx 27411 iEdgciedg 27412 UPGraphcupgr 27495 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-resscn 10974 ax-1cn 10975 ax-icn 10976 ax-addcl 10977 ax-addrcl 10978 ax-mulcl 10979 ax-mulrcl 10980 ax-i2m1 10985 ax-1ne0 10986 ax-rrecex 10989 ax-cnre 10990 ax-pre-lttri 10991 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-ov 7310 df-1st 7863 df-2nd 7864 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11057 df-mnf 11058 df-xr 11059 df-ltxr 11060 df-le 11061 df-2 12082 df-vtx 27413 df-iedg 27414 df-upgr 27497 df-umgr 27498 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |