| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgrwopreglem4 | Structured version Visualization version GIF version | ||
| Description: Lemma 4 for frgrwopreg 30252. In a friendship graph each vertex with degree 𝐾 is connected with any vertex with degree other than 𝐾. This corresponds to statement 4 in [Huneke] p. 2: "By the first claim, every vertex in A is adjacent to every vertex in B.". (Contributed by Alexander van der Vekens, 30-Dec-2017.) (Revised by AV, 10-May-2021.) (Proof shortened by AV, 4-Feb-2022.) |
| Ref | Expression |
|---|---|
| frgrwopreg.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| frgrwopreg.d | ⊢ 𝐷 = (VtxDeg‘𝐺) |
| frgrwopreg.a | ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} |
| frgrwopreg.b | ⊢ 𝐵 = (𝑉 ∖ 𝐴) |
| frgrwopreg.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| frgrwopreglem4 | ⊢ (𝐺 ∈ FriendGraph → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 {𝑎, 𝑏} ∈ 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → 𝐺 ∈ FriendGraph ) | |
| 2 | elrabi 3654 | . . . . . 6 ⊢ (𝑎 ∈ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} → 𝑎 ∈ 𝑉) | |
| 3 | frgrwopreg.a | . . . . . 6 ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} | |
| 4 | 2, 3 | eleq2s 2846 | . . . . 5 ⊢ (𝑎 ∈ 𝐴 → 𝑎 ∈ 𝑉) |
| 5 | eldifi 4094 | . . . . . 6 ⊢ (𝑏 ∈ (𝑉 ∖ 𝐴) → 𝑏 ∈ 𝑉) | |
| 6 | frgrwopreg.b | . . . . . 6 ⊢ 𝐵 = (𝑉 ∖ 𝐴) | |
| 7 | 5, 6 | eleq2s 2846 | . . . . 5 ⊢ (𝑏 ∈ 𝐵 → 𝑏 ∈ 𝑉) |
| 8 | 4, 7 | anim12i 613 | . . . 4 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) |
| 9 | 8 | adantl 481 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) |
| 10 | frgrwopreg.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 11 | frgrwopreg.d | . . . . 5 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
| 12 | 10, 11, 3, 6 | frgrwopreglem3 30243 | . . . 4 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝐷‘𝑎) ≠ (𝐷‘𝑏)) |
| 13 | 12 | adantl 481 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → (𝐷‘𝑎) ≠ (𝐷‘𝑏)) |
| 14 | frgrwopreg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 15 | 10, 11, 14 | frgrwopreglem4a 30239 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝐷‘𝑎) ≠ (𝐷‘𝑏)) → {𝑎, 𝑏} ∈ 𝐸) |
| 16 | 1, 9, 13, 15 | syl3anc 1373 | . 2 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → {𝑎, 𝑏} ∈ 𝐸) |
| 17 | 16 | ralrimivva 3180 | 1 ⊢ (𝐺 ∈ FriendGraph → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 {𝑎, 𝑏} ∈ 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 {crab 3405 ∖ cdif 3911 {cpr 4591 ‘cfv 6511 Vtxcvtx 28923 Edgcedg 28974 VtxDegcvtxdg 29393 FriendGraph cfrgr 30187 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-oadd 8438 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-dju 9854 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-n0 12443 df-xnn0 12516 df-z 12530 df-uz 12794 df-xadd 13073 df-fz 13469 df-hash 14296 df-edg 28975 df-uhgr 28985 df-ushgr 28986 df-upgr 29009 df-umgr 29010 df-uspgr 29077 df-usgr 29078 df-nbgr 29260 df-vtxdg 29394 df-frgr 30188 |
| This theorem is referenced by: frgrwopregasn 30245 frgrwopregbsn 30246 frgrwopreglem5ALT 30251 |
| Copyright terms: Public domain | W3C validator |