Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgravd0nedg | Structured version Visualization version GIF version |
Description: If a vertex in a simple graph has degree 0, the vertex is not adjacent to another vertex via an edge, analogous to vdusgra0nedg 26435. (Contributed by Alexander van der Vekens, 20-Dec-2017.) |
Ref | Expression |
---|---|
usgravd0nedg | ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → (((𝑉 VDeg 𝐸)‘𝑈) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vdusgraval 26434 | . . 3 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → ((𝑉 VDeg 𝐸)‘𝑈) = (#‘{𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)})) | |
2 | 1 | eqeq1d 2612 | . 2 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → (((𝑉 VDeg 𝐸)‘𝑈) = 0 ↔ (#‘{𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)}) = 0)) |
3 | usgrav 25867 | . . . . . 6 ⊢ (𝑉 USGrph 𝐸 → (𝑉 ∈ V ∧ 𝐸 ∈ V)) | |
4 | 3 | simprd 478 | . . . . 5 ⊢ (𝑉 USGrph 𝐸 → 𝐸 ∈ V) |
5 | 4 | adantr 480 | . . . 4 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → 𝐸 ∈ V) |
6 | dmexg 6989 | . . . 4 ⊢ (𝐸 ∈ V → dom 𝐸 ∈ V) | |
7 | rabexg 4739 | . . . 4 ⊢ (dom 𝐸 ∈ V → {𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)} ∈ V) | |
8 | hasheq0 13015 | . . . 4 ⊢ ({𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)} ∈ V → ((#‘{𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)}) = 0 ↔ {𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)} = ∅)) | |
9 | 5, 6, 7, 8 | 4syl 19 | . . 3 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → ((#‘{𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)}) = 0 ↔ {𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)} = ∅)) |
10 | rabeq0 3911 | . . . 4 ⊢ ({𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)} = ∅ ↔ ∀𝑥 ∈ dom 𝐸 ¬ 𝑈 ∈ (𝐸‘𝑥)) | |
11 | ralnex 2975 | . . . . 5 ⊢ (∀𝑥 ∈ dom 𝐸 ¬ 𝑈 ∈ (𝐸‘𝑥) ↔ ¬ ∃𝑥 ∈ dom 𝐸 𝑈 ∈ (𝐸‘𝑥)) | |
12 | usgrafun 25878 | . . . . . . . . . . 11 ⊢ (𝑉 USGrph 𝐸 → Fun 𝐸) | |
13 | 12 | adantr 480 | . . . . . . . . . 10 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → Fun 𝐸) |
14 | 13 | adantr 480 | . . . . . . . . 9 ⊢ (((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → Fun 𝐸) |
15 | elrnrexdm 6271 | . . . . . . . . 9 ⊢ (Fun 𝐸 → ({𝑈, 𝑣} ∈ ran 𝐸 → ∃𝑥 ∈ dom 𝐸{𝑈, 𝑣} = (𝐸‘𝑥))) | |
16 | 14, 15 | syl 17 | . . . . . . . 8 ⊢ (((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → ({𝑈, 𝑣} ∈ ran 𝐸 → ∃𝑥 ∈ dom 𝐸{𝑈, 𝑣} = (𝐸‘𝑥))) |
17 | prid1g 4239 | . . . . . . . . . . 11 ⊢ (𝑈 ∈ 𝑉 → 𝑈 ∈ {𝑈, 𝑣}) | |
18 | eleq2 2677 | . . . . . . . . . . . 12 ⊢ ((𝐸‘𝑥) = {𝑈, 𝑣} → (𝑈 ∈ (𝐸‘𝑥) ↔ 𝑈 ∈ {𝑈, 𝑣})) | |
19 | 18 | eqcoms 2618 | . . . . . . . . . . 11 ⊢ ({𝑈, 𝑣} = (𝐸‘𝑥) → (𝑈 ∈ (𝐸‘𝑥) ↔ 𝑈 ∈ {𝑈, 𝑣})) |
20 | 17, 19 | syl5ibrcom 236 | . . . . . . . . . 10 ⊢ (𝑈 ∈ 𝑉 → ({𝑈, 𝑣} = (𝐸‘𝑥) → 𝑈 ∈ (𝐸‘𝑥))) |
21 | 20 | ad2antlr 759 | . . . . . . . . 9 ⊢ (((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → ({𝑈, 𝑣} = (𝐸‘𝑥) → 𝑈 ∈ (𝐸‘𝑥))) |
22 | 21 | reximdv 2999 | . . . . . . . 8 ⊢ (((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → (∃𝑥 ∈ dom 𝐸{𝑈, 𝑣} = (𝐸‘𝑥) → ∃𝑥 ∈ dom 𝐸 𝑈 ∈ (𝐸‘𝑥))) |
23 | 16, 22 | syld 46 | . . . . . . 7 ⊢ (((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → ({𝑈, 𝑣} ∈ ran 𝐸 → ∃𝑥 ∈ dom 𝐸 𝑈 ∈ (𝐸‘𝑥))) |
24 | 23 | rexlimdva 3013 | . . . . . 6 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → (∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸 → ∃𝑥 ∈ dom 𝐸 𝑈 ∈ (𝐸‘𝑥))) |
25 | 24 | con3d 147 | . . . . 5 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → (¬ ∃𝑥 ∈ dom 𝐸 𝑈 ∈ (𝐸‘𝑥) → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸)) |
26 | 11, 25 | syl5bi 231 | . . . 4 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → (∀𝑥 ∈ dom 𝐸 ¬ 𝑈 ∈ (𝐸‘𝑥) → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸)) |
27 | 10, 26 | syl5bi 231 | . . 3 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → ({𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)} = ∅ → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸)) |
28 | 9, 27 | sylbid 229 | . 2 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → ((#‘{𝑥 ∈ dom 𝐸 ∣ 𝑈 ∈ (𝐸‘𝑥)}) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸)) |
29 | 2, 28 | sylbid 229 | 1 ⊢ ((𝑉 USGrph 𝐸 ∧ 𝑈 ∈ 𝑉) → (((𝑉 VDeg 𝐸)‘𝑈) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ ran 𝐸)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 {crab 2900 Vcvv 3173 ∅c0 3874 {cpr 4127 class class class wbr 4583 dom cdm 5038 ran crn 5039 Fun wfun 5798 ‘cfv 5804 (class class class)co 6549 0cc0 9815 #chash 12979 USGrph cusg 25859 VDeg cvdg 26420 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-xadd 11823 df-fz 12198 df-hash 12980 df-usgra 25862 df-vdgr 26421 |
This theorem is referenced by: usgravd00 26446 |
Copyright terms: Public domain | W3C validator |