Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgr1e | Structured version Visualization version GIF version |
Description: A simple graph with one edge (with additional assumption that 𝐵 ≠ 𝐶 since otherwise the edge is a loop!). (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 18-Oct-2020.) |
Ref | Expression |
---|---|
uspgr1e.v | ⊢ 𝑉 = (Vtx‘𝐺) |
uspgr1e.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
uspgr1e.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
uspgr1e.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
uspgr1e.e | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) |
usgr1e.e | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
Ref | Expression |
---|---|
usgr1e | ⊢ (𝜑 → 𝐺 ∈ USGraph ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uspgr1e.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | uspgr1e.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
3 | uspgr1e.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
4 | uspgr1e.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
5 | uspgr1e.e | . . 3 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝐵, 𝐶}〉}) | |
6 | 1, 2, 3, 4, 5 | uspgr1e 26136 | . 2 ⊢ (𝜑 → 𝐺 ∈ USPGraph ) |
7 | usgr1e.e | . . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
8 | hashprg 13182 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐵 ≠ 𝐶 ↔ (#‘{𝐵, 𝐶}) = 2)) | |
9 | 3, 4, 8 | syl2anc 693 | . . . . 5 ⊢ (𝜑 → (𝐵 ≠ 𝐶 ↔ (#‘{𝐵, 𝐶}) = 2)) |
10 | 7, 9 | mpbid 222 | . . . 4 ⊢ (𝜑 → (#‘{𝐵, 𝐶}) = 2) |
11 | prex 4909 | . . . . 5 ⊢ {𝐵, 𝐶} ∈ V | |
12 | fveq2 6191 | . . . . . 6 ⊢ (𝑥 = {𝐵, 𝐶} → (#‘𝑥) = (#‘{𝐵, 𝐶})) | |
13 | 12 | eqeq1d 2624 | . . . . 5 ⊢ (𝑥 = {𝐵, 𝐶} → ((#‘𝑥) = 2 ↔ (#‘{𝐵, 𝐶}) = 2)) |
14 | 11, 13 | ralsn 4222 | . . . 4 ⊢ (∀𝑥 ∈ {{𝐵, 𝐶}} (#‘𝑥) = 2 ↔ (#‘{𝐵, 𝐶}) = 2) |
15 | 10, 14 | sylibr 224 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ {{𝐵, 𝐶}} (#‘𝑥) = 2) |
16 | edgval 25941 | . . . . . 6 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
17 | 16 | a1i 11 | . . . . 5 ⊢ (𝜑 → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
18 | 5 | rneqd 5353 | . . . . 5 ⊢ (𝜑 → ran (iEdg‘𝐺) = ran {〈𝐴, {𝐵, 𝐶}〉}) |
19 | rnsnopg 5614 | . . . . . 6 ⊢ (𝐴 ∈ 𝑋 → ran {〈𝐴, {𝐵, 𝐶}〉} = {{𝐵, 𝐶}}) | |
20 | 2, 19 | syl 17 | . . . . 5 ⊢ (𝜑 → ran {〈𝐴, {𝐵, 𝐶}〉} = {{𝐵, 𝐶}}) |
21 | 17, 18, 20 | 3eqtrd 2660 | . . . 4 ⊢ (𝜑 → (Edg‘𝐺) = {{𝐵, 𝐶}}) |
22 | 21 | raleqdv 3144 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ (Edg‘𝐺)(#‘𝑥) = 2 ↔ ∀𝑥 ∈ {{𝐵, 𝐶}} (#‘𝑥) = 2)) |
23 | 15, 22 | mpbird 247 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (Edg‘𝐺)(#‘𝑥) = 2) |
24 | usgruspgrb 26076 | . 2 ⊢ (𝐺 ∈ USGraph ↔ (𝐺 ∈ USPGraph ∧ ∀𝑥 ∈ (Edg‘𝐺)(#‘𝑥) = 2)) | |
25 | 6, 23, 24 | sylanbrc 698 | 1 ⊢ (𝜑 → 𝐺 ∈ USGraph ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 {csn 4177 {cpr 4179 〈cop 4183 ran crn 5115 ‘cfv 5888 2c2 11070 #chash 13117 Vtxcvtx 25874 iEdgciedg 25875 Edgcedg 25939 USPGraph cuspgr 26043 USGraph cusgr 26044 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-fz 12327 df-hash 13118 df-edg 25940 df-uspgr 26045 df-usgr 26046 |
This theorem is referenced by: usgr1eop 26142 1egrvtxdg1 26405 1egrvtxdg0 26407 |
Copyright terms: Public domain | W3C validator |