Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > usgraedgrnv | Structured version Visualization version GIF version |
Description: An edge of an undirected simple graph always connects two vertices. (Contributed by Alexander van der Vekens, 7-Oct-2017.) |
Ref | Expression |
---|---|
usgraedgrnv | ⊢ ((𝑉 USGrph 𝐸 ∧ {𝑀, 𝑁} ∈ ran 𝐸) → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | usgraf0 25877 | . . 3 ⊢ (𝑉 USGrph 𝐸 → 𝐸:dom 𝐸–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) | |
2 | f1f 6014 | . . 3 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) | |
3 | df-f 5808 | . . . 4 ⊢ (𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ (𝐸 Fn dom 𝐸 ∧ ran 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})) | |
4 | ssel2 3563 | . . . . . . 7 ⊢ ((ran 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ∧ {𝑀, 𝑁} ∈ ran 𝐸) → {𝑀, 𝑁} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) | |
5 | fveq2 6103 | . . . . . . . . . 10 ⊢ (𝑥 = {𝑀, 𝑁} → (#‘𝑥) = (#‘{𝑀, 𝑁})) | |
6 | 5 | eqeq1d 2612 | . . . . . . . . 9 ⊢ (𝑥 = {𝑀, 𝑁} → ((#‘𝑥) = 2 ↔ (#‘{𝑀, 𝑁}) = 2)) |
7 | 6 | elrab 3331 | . . . . . . . 8 ⊢ ({𝑀, 𝑁} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ ({𝑀, 𝑁} ∈ 𝒫 𝑉 ∧ (#‘{𝑀, 𝑁}) = 2)) |
8 | prex 4836 | . . . . . . . . . . 11 ⊢ {𝑀, 𝑁} ∈ V | |
9 | 8 | elpw 4114 | . . . . . . . . . 10 ⊢ ({𝑀, 𝑁} ∈ 𝒫 𝑉 ↔ {𝑀, 𝑁} ⊆ 𝑉) |
10 | ianor 508 | . . . . . . . . . . . . . 14 ⊢ (¬ (𝑀 ∈ V ∧ 𝑁 ∈ V) ↔ (¬ 𝑀 ∈ V ∨ ¬ 𝑁 ∈ V)) | |
11 | elprchashprn2 13045 | . . . . . . . . . . . . . . 15 ⊢ (¬ 𝑀 ∈ V → ¬ (#‘{𝑀, 𝑁}) = 2) | |
12 | elprchashprn2 13045 | . . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑁 ∈ V → ¬ (#‘{𝑁, 𝑀}) = 2) | |
13 | prcom 4211 | . . . . . . . . . . . . . . . . . . 19 ⊢ {𝑁, 𝑀} = {𝑀, 𝑁} | |
14 | 13 | a1i 11 | . . . . . . . . . . . . . . . . . 18 ⊢ (¬ 𝑁 ∈ V → {𝑁, 𝑀} = {𝑀, 𝑁}) |
15 | 14 | fveq2d 6107 | . . . . . . . . . . . . . . . . 17 ⊢ (¬ 𝑁 ∈ V → (#‘{𝑁, 𝑀}) = (#‘{𝑀, 𝑁})) |
16 | 15 | eqeq1d 2612 | . . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑁 ∈ V → ((#‘{𝑁, 𝑀}) = 2 ↔ (#‘{𝑀, 𝑁}) = 2)) |
17 | 12, 16 | mtbid 313 | . . . . . . . . . . . . . . 15 ⊢ (¬ 𝑁 ∈ V → ¬ (#‘{𝑀, 𝑁}) = 2) |
18 | 11, 17 | jaoi 393 | . . . . . . . . . . . . . 14 ⊢ ((¬ 𝑀 ∈ V ∨ ¬ 𝑁 ∈ V) → ¬ (#‘{𝑀, 𝑁}) = 2) |
19 | 10, 18 | sylbi 206 | . . . . . . . . . . . . 13 ⊢ (¬ (𝑀 ∈ V ∧ 𝑁 ∈ V) → ¬ (#‘{𝑀, 𝑁}) = 2) |
20 | 19 | con4i 112 | . . . . . . . . . . . 12 ⊢ ((#‘{𝑀, 𝑁}) = 2 → (𝑀 ∈ V ∧ 𝑁 ∈ V)) |
21 | prssg 4290 | . . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ V ∧ 𝑁 ∈ V) → ((𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ↔ {𝑀, 𝑁} ⊆ 𝑉)) | |
22 | 21 | biimprd 237 | . . . . . . . . . . . 12 ⊢ ((𝑀 ∈ V ∧ 𝑁 ∈ V) → ({𝑀, 𝑁} ⊆ 𝑉 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
23 | 20, 22 | syl 17 | . . . . . . . . . . 11 ⊢ ((#‘{𝑀, 𝑁}) = 2 → ({𝑀, 𝑁} ⊆ 𝑉 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
24 | 23 | com12 32 | . . . . . . . . . 10 ⊢ ({𝑀, 𝑁} ⊆ 𝑉 → ((#‘{𝑀, 𝑁}) = 2 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
25 | 9, 24 | sylbi 206 | . . . . . . . . 9 ⊢ ({𝑀, 𝑁} ∈ 𝒫 𝑉 → ((#‘{𝑀, 𝑁}) = 2 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
26 | 25 | imp 444 | . . . . . . . 8 ⊢ (({𝑀, 𝑁} ∈ 𝒫 𝑉 ∧ (#‘{𝑀, 𝑁}) = 2) → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
27 | 7, 26 | sylbi 206 | . . . . . . 7 ⊢ ({𝑀, 𝑁} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
28 | 4, 27 | syl 17 | . . . . . 6 ⊢ ((ran 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ∧ {𝑀, 𝑁} ∈ ran 𝐸) → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
29 | 28 | ex 449 | . . . . 5 ⊢ (ran 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ({𝑀, 𝑁} ∈ ran 𝐸 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
30 | 29 | adantl 481 | . . . 4 ⊢ ((𝐸 Fn dom 𝐸 ∧ ran 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) → ({𝑀, 𝑁} ∈ ran 𝐸 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
31 | 3, 30 | sylbi 206 | . . 3 ⊢ (𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ({𝑀, 𝑁} ∈ ran 𝐸 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
32 | 1, 2, 31 | 3syl 18 | . 2 ⊢ (𝑉 USGrph 𝐸 → ({𝑀, 𝑁} ∈ ran 𝐸 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
33 | 32 | imp 444 | 1 ⊢ ((𝑉 USGrph 𝐸 ∧ {𝑀, 𝑁} ∈ ran 𝐸) → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 382 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {crab 2900 Vcvv 3173 ⊆ wss 3540 𝒫 cpw 4108 {cpr 4127 class class class wbr 4583 dom cdm 5038 ran crn 5039 Fn wfn 5799 ⟶wf 5800 –1-1→wf1 5801 ‘cfv 5804 2c2 10947 #chash 12979 USGrph cusg 25859 |
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-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-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-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 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-z 11255 df-uz 11564 df-fz 12198 df-hash 12980 df-usgra 25862 |
This theorem is referenced by: nbusgra 25957 nbgra0nb 25958 nbgraeledg 25959 nbgraisvtx 25960 usgra2adedgspthlem2 26140 usgra2adedgspth 26141 usgra2adedgwlk 26142 usgra2adedgwlkon 26143 constr3trllem2 26179 constr3trllem5 26182 frgranbnb 26547 frgraeu 26581 extwwlkfablem1 26601 numclwwlkun 26606 |
Copyright terms: Public domain | W3C validator |