Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgrexi | Structured version Visualization version GIF version |
Description: An arbitrary set regarded as vertices together with the set of pairs of elements of this set regarded as edges is a simple graph. (Contributed by Alexander van der Vekens, 12-Jan-2018.) (Revised by AV, 5-Nov-2020.) (Proof shortened by AV, 10-Nov-2021.) |
Ref | Expression |
---|---|
usgrexi.p | ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
Ref | Expression |
---|---|
usgrexi | ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ( I ↾ 𝑃)〉 ∈ USGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | usgrexi.p | . . . 4 ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} | |
2 | 1 | usgrexilem 27203 | . . 3 ⊢ (𝑉 ∈ 𝑊 → ( I ↾ 𝑃):dom ( I ↾ 𝑃)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}) |
3 | 1 | cusgrexilem1 27202 | . . . . 5 ⊢ (𝑉 ∈ 𝑊 → ( I ↾ 𝑃) ∈ V) |
4 | opiedgfv 26773 | . . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑃) ∈ V) → (iEdg‘〈𝑉, ( I ↾ 𝑃)〉) = ( I ↾ 𝑃)) | |
5 | 3, 4 | mpdan 685 | . . . 4 ⊢ (𝑉 ∈ 𝑊 → (iEdg‘〈𝑉, ( I ↾ 𝑃)〉) = ( I ↾ 𝑃)) |
6 | 5 | dmeqd 5755 | . . . 4 ⊢ (𝑉 ∈ 𝑊 → dom (iEdg‘〈𝑉, ( I ↾ 𝑃)〉) = dom ( I ↾ 𝑃)) |
7 | opvtxfv 26770 | . . . . . . 7 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑃) ∈ V) → (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) = 𝑉) | |
8 | 3, 7 | mpdan 685 | . . . . . 6 ⊢ (𝑉 ∈ 𝑊 → (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) = 𝑉) |
9 | 8 | pweqd 4539 | . . . . 5 ⊢ (𝑉 ∈ 𝑊 → 𝒫 (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) = 𝒫 𝑉) |
10 | 9 | rabeqdv 3471 | . . . 4 ⊢ (𝑉 ∈ 𝑊 → {𝑥 ∈ 𝒫 (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}) |
11 | 5, 6, 10 | f1eq123d 6589 | . . 3 ⊢ (𝑉 ∈ 𝑊 → ((iEdg‘〈𝑉, ( I ↾ 𝑃)〉):dom (iEdg‘〈𝑉, ( I ↾ 𝑃)〉)–1-1→{𝑥 ∈ 𝒫 (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) ∣ (♯‘𝑥) = 2} ↔ ( I ↾ 𝑃):dom ( I ↾ 𝑃)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})) |
12 | 2, 11 | mpbird 259 | . 2 ⊢ (𝑉 ∈ 𝑊 → (iEdg‘〈𝑉, ( I ↾ 𝑃)〉):dom (iEdg‘〈𝑉, ( I ↾ 𝑃)〉)–1-1→{𝑥 ∈ 𝒫 (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) ∣ (♯‘𝑥) = 2}) |
13 | opex 5337 | . . 3 ⊢ 〈𝑉, ( I ↾ 𝑃)〉 ∈ V | |
14 | eqid 2820 | . . . 4 ⊢ (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) = (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) | |
15 | eqid 2820 | . . . 4 ⊢ (iEdg‘〈𝑉, ( I ↾ 𝑃)〉) = (iEdg‘〈𝑉, ( I ↾ 𝑃)〉) | |
16 | 14, 15 | isusgrs 26922 | . . 3 ⊢ (〈𝑉, ( I ↾ 𝑃)〉 ∈ V → (〈𝑉, ( I ↾ 𝑃)〉 ∈ USGraph ↔ (iEdg‘〈𝑉, ( I ↾ 𝑃)〉):dom (iEdg‘〈𝑉, ( I ↾ 𝑃)〉)–1-1→{𝑥 ∈ 𝒫 (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) ∣ (♯‘𝑥) = 2})) |
17 | 13, 16 | mp1i 13 | . 2 ⊢ (𝑉 ∈ 𝑊 → (〈𝑉, ( I ↾ 𝑃)〉 ∈ USGraph ↔ (iEdg‘〈𝑉, ( I ↾ 𝑃)〉):dom (iEdg‘〈𝑉, ( I ↾ 𝑃)〉)–1-1→{𝑥 ∈ 𝒫 (Vtx‘〈𝑉, ( I ↾ 𝑃)〉) ∣ (♯‘𝑥) = 2})) |
18 | 12, 17 | mpbird 259 | 1 ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ( I ↾ 𝑃)〉 ∈ USGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 {crab 3137 Vcvv 3481 𝒫 cpw 4520 〈cop 4554 I cid 5440 dom cdm 5536 ↾ cres 5538 –1-1→wf1 6333 ‘cfv 6336 2c2 11674 ♯chash 13675 Vtxcvtx 26762 iEdgciedg 26763 USGraphcusgr 26915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2792 ax-sep 5184 ax-nul 5191 ax-pow 5247 ax-pr 5311 ax-un 7442 ax-cnex 10574 ax-resscn 10575 ax-1cn 10576 ax-icn 10577 ax-addcl 10578 ax-addrcl 10579 ax-mulcl 10580 ax-mulrcl 10581 ax-mulcom 10582 ax-addass 10583 ax-mulass 10584 ax-distr 10585 ax-i2m1 10586 ax-1ne0 10587 ax-1rid 10588 ax-rnegex 10589 ax-rrecex 10590 ax-cnre 10591 ax-pre-lttri 10592 ax-pre-lttrn 10593 ax-pre-ltadd 10594 ax-pre-mulgt0 10595 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2891 df-nfc 2959 df-ne 3012 df-nel 3119 df-ral 3138 df-rex 3139 df-reu 3140 df-rab 3142 df-v 3483 df-sbc 3759 df-csb 3867 df-dif 3922 df-un 3924 df-in 3926 df-ss 3935 df-pss 3937 df-nul 4275 df-if 4449 df-pw 4522 df-sn 4549 df-pr 4551 df-tp 4553 df-op 4555 df-uni 4820 df-int 4858 df-iun 4902 df-br 5048 df-opab 5110 df-mpt 5128 df-tr 5154 df-id 5441 df-eprel 5446 df-po 5455 df-so 5456 df-fr 5495 df-we 5497 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-riota 7095 df-ov 7140 df-oprab 7141 df-mpo 7142 df-om 7562 df-1st 7670 df-2nd 7671 df-wrecs 7928 df-recs 7989 df-rdg 8027 df-1o 8083 df-er 8270 df-en 8491 df-dom 8492 df-sdom 8493 df-fin 8494 df-card 9349 df-pnf 10658 df-mnf 10659 df-xr 10660 df-ltxr 10661 df-le 10662 df-sub 10853 df-neg 10854 df-nn 11620 df-2 11682 df-n0 11880 df-z 11964 df-uz 12226 df-fz 12878 df-hash 13676 df-vtx 26764 df-iedg 26765 df-usgr 26917 |
This theorem is referenced by: cusgrexi 27206 |
Copyright terms: Public domain | W3C validator |