| 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 30615. 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 487 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → 𝐺 ∈ FriendGraph ) | |
| 2 | elrabi 3653 | . . . . . 6 ⊢ (𝑎 ∈ {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} → 𝑎 ∈ 𝑉) | |
| 3 | frgrwopreg.a | . . . . . 6 ⊢ 𝐴 = {𝑥 ∈ 𝑉 ∣ (𝐷‘𝑥) = 𝐾} | |
| 4 | 2, 3 | eleq2s 2887 | . . . . 5 ⊢ (𝑎 ∈ 𝐴 → 𝑎 ∈ 𝑉) |
| 5 | eldifi 4091 | . . . . . 6 ⊢ (𝑏 ∈ (𝑉 ∖ 𝐴) → 𝑏 ∈ 𝑉) | |
| 6 | frgrwopreg.b | . . . . . 6 ⊢ 𝐵 = (𝑉 ∖ 𝐴) | |
| 7 | 5, 6 | eleq2s 2887 | . . . . 5 ⊢ (𝑏 ∈ 𝐵 → 𝑏 ∈ 𝑉) |
| 8 | 4, 7 | anim12i 624 | . . . 4 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) |
| 9 | 8 | adantl 486 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) |
| 10 | frgrwopreg.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 11 | frgrwopreg.d | . . . . 5 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
| 12 | 10, 11, 3, 6 | frgrwopreglem3 30606 | . . . 4 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝐷‘𝑎) ≠ (𝐷‘𝑏)) |
| 13 | 12 | adantl 486 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → (𝐷‘𝑎) ≠ (𝐷‘𝑏)) |
| 14 | frgrwopreg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 15 | 10, 11, 14 | frgrwopreglem4a 30602 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝐷‘𝑎) ≠ (𝐷‘𝑏)) → {𝑎, 𝑏} ∈ 𝐸) |
| 16 | 1, 9, 13, 15 | syl3anc 1396 | . 2 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → {𝑎, 𝑏} ∈ 𝐸) |
| 17 | 16 | ralrimivva 3214 | 1 ⊢ (𝐺 ∈ FriendGraph → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 {𝑎, 𝑏} ∈ 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 {crab 3422 ∖ cdif 3908 {cpr 4594 ‘cfv 6537 Vtxcvtx 29287 Edgcedg 29338 VtxDegcvtxdg 29756 FriendGraph cfrgr 30550 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-oadd 8457 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-n0 12505 df-xnn0 12578 df-z 12592 df-uz 12863 df-xadd 13138 df-fz 13536 df-hash 14367 df-edg 29339 df-uhgr 29349 df-ushgr 29350 df-upgr 29373 df-umgr 29374 df-uspgr 29441 df-usgr 29442 df-nbgr 29624 df-vtxdg 29757 df-frgr 30551 |
| This theorem is referenced by: frgrwopregasn 30608 frgrwopregbsn 30609 frgrwopreglem5ALT 30614 |
| Copyright terms: Public domain | W3C validator |