| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrop | Structured version Visualization version GIF version | ||
| Description: A simple graph represented by an ordered pair. (Contributed by AV, 23-Oct-2020.) (Proof shortened by AV, 30-Nov-2020.) |
| Ref | Expression |
|---|---|
| usgrop | ⊢ (𝐺 ∈ USGraph → 〈(Vtx‘𝐺), (iEdg‘𝐺)〉 ∈ USGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2765 | . . 3 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 1, 2 | usgrfs 29570 | . 2 ⊢ (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2}) |
| 4 | fvex 6899 | . . . 4 ⊢ (Vtx‘𝐺) ∈ V | |
| 5 | fvex 6899 | . . . 4 ⊢ (iEdg‘𝐺) ∈ V | |
| 6 | 4, 5 | pm3.2i 476 | . . 3 ⊢ ((Vtx‘𝐺) ∈ V ∧ (iEdg‘𝐺) ∈ V) |
| 7 | isusgrop 29575 | . . 3 ⊢ (((Vtx‘𝐺) ∈ V ∧ (iEdg‘𝐺) ∈ V) → (〈(Vtx‘𝐺), (iEdg‘𝐺)〉 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})) | |
| 8 | 6, 7 | mp1i 14 | . 2 ⊢ (𝐺 ∈ USGraph → (〈(Vtx‘𝐺), (iEdg‘𝐺)〉 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (♯‘𝑥) = 2})) |
| 9 | 3, 8 | mpbird 260 | 1 ⊢ (𝐺 ∈ USGraph → 〈(Vtx‘𝐺), (iEdg‘𝐺)〉 ∈ USGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {crab 3418 Vcvv 3457 𝒫 cpw 4564 〈cop 4597 dom cdm 5663 –1-1→wf1 6538 ‘cfv 6541 2c2 12315 ♯chash 14389 Vtxcvtx 29406 iEdgciedg 29407 USGraphcusgr 29562 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7743 ax-cnex 11176 ax-resscn 11177 ax-1cn 11178 ax-icn 11179 ax-addcl 11180 ax-addrcl 11181 ax-mulcl 11182 ax-mulrcl 11183 ax-mulcom 11184 ax-addass 11185 ax-mulass 11186 ax-distr 11187 ax-i2m1 11188 ax-1ne0 11189 ax-1rid 11190 ax-rnegex 11191 ax-rrecex 11192 ax-cnre 11193 ax-pre-lttri 11194 ax-pre-lttrn 11195 ax-pre-ltadd 11196 ax-pre-mulgt0 11197 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7870 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-1o 8460 df-er 8701 df-en 8951 df-dom 8952 df-sdom 8953 df-fin 8954 df-card 9942 df-pnf 11265 df-mnf 11266 df-xr 11267 df-ltxr 11268 df-le 11269 df-sub 11463 df-neg 11464 df-nn 12254 df-2 12323 df-n0 12525 df-z 12612 df-uz 12884 df-fz 13557 df-hash 14390 df-vtx 29408 df-iedg 29409 df-usgr 29564 |
| This theorem is used by: fusgrfis 29743 cusgrop 29851 |
| Copyright terms: Public domain | W3C validator |