![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > upgr1e | Structured version Visualization version GIF version |
Description: A pseudograph with one edge. Such a graph is actually a simple pseudograph, see uspgr1e 27034. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 16-Oct-2020.) (Revised by AV, 21-Mar-2021.) (Proof shortened by AV, 17-Apr-2021.) |
Ref | Expression |
---|---|
upgr1e.v | ⊢ 𝑉 = (Vtx‘𝐺) |
upgr1e.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
upgr1e.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
upgr1e.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
upgr1e.e | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) |
Ref | Expression |
---|---|
upgr1e | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upgr1e.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
2 | prex 5298 | . . . . . . . 8 ⊢ {𝐵, 𝐶} ∈ V | |
3 | 2 | snid 4561 | . . . . . . 7 ⊢ {𝐵, 𝐶} ∈ {{𝐵, 𝐶}} |
4 | 3 | a1i 11 | . . . . . 6 ⊢ (𝜑 → {𝐵, 𝐶} ∈ {{𝐵, 𝐶}}) |
5 | 1, 4 | fsnd 6632 | . . . . 5 ⊢ (𝜑 → {〈𝐴, {𝐵, 𝐶}〉}:{𝐴}⟶{{𝐵, 𝐶}}) |
6 | upgr1e.b | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
7 | upgr1e.c | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
8 | 6, 7 | prssd 4715 | . . . . . . . 8 ⊢ (𝜑 → {𝐵, 𝐶} ⊆ 𝑉) |
9 | upgr1e.v | . . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺) | |
10 | 8, 9 | sseqtrdi 3965 | . . . . . . 7 ⊢ (𝜑 → {𝐵, 𝐶} ⊆ (Vtx‘𝐺)) |
11 | 2 | elpw 4501 | . . . . . . 7 ⊢ ({𝐵, 𝐶} ∈ 𝒫 (Vtx‘𝐺) ↔ {𝐵, 𝐶} ⊆ (Vtx‘𝐺)) |
12 | 10, 11 | sylibr 237 | . . . . . 6 ⊢ (𝜑 → {𝐵, 𝐶} ∈ 𝒫 (Vtx‘𝐺)) |
13 | 12, 6 | upgr1elem 26905 | . . . . 5 ⊢ (𝜑 → {{𝐵, 𝐶}} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
14 | 5, 13 | fssd 6502 | . . . 4 ⊢ (𝜑 → {〈𝐴, {𝐵, 𝐶}〉}:{𝐴}⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
15 | 14 | ffdmd 6511 | . . 3 ⊢ (𝜑 → {〈𝐴, {𝐵, 𝐶}〉}:dom {〈𝐴, {𝐵, 𝐶}〉}⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
16 | upgr1e.e | . . . 4 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) | |
17 | 16 | dmeqd 5738 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, {𝐵, 𝐶}〉}) |
18 | 16, 17 | feq12d 6475 | . . 3 ⊢ (𝜑 → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ↔ {〈𝐴, {𝐵, 𝐶}〉}:dom {〈𝐴, {𝐵, 𝐶}〉}⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
19 | 15, 18 | mpbird 260 | . 2 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
20 | 9 | 1vgrex 26795 | . . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐺 ∈ V) |
21 | eqid 2798 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
22 | eqid 2798 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
23 | 21, 22 | isupgr 26877 | . . 3 ⊢ (𝐺 ∈ V → (𝐺 ∈ UPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
24 | 6, 20, 23 | 3syl 18 | . 2 ⊢ (𝜑 → (𝐺 ∈ UPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
25 | 19, 24 | mpbird 260 | 1 ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 = wceq 1538 ∈ wcel 2111 {crab 3110 Vcvv 3441 ∖ cdif 3878 ⊆ wss 3881 ∅c0 4243 𝒫 cpw 4497 {csn 4525 {cpr 4527 〈cop 4531 class class class wbr 5030 dom cdm 5519 ⟶wf 6320 ‘cfv 6324 ≤ cle 10665 2c2 11680 ♯chash 13686 Vtxcvtx 26789 iEdgciedg 26790 UPGraphcupgr 26873 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-dju 9314 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-fz 12886 df-hash 13687 df-upgr 26875 |
This theorem is referenced by: upgr1eop 26908 upgr1eopALT 26910 |
Copyright terms: Public domain | W3C validator |