| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgrncvvdeqlem7 | Structured version Visualization version GIF version | ||
| Description: Lemma 7 for frgrncvvdeq 30969. This corresponds to statement 1 in [Huneke] p. 1: "This common neighbor cannot be x, as x and y are not adjacent.". This is only an observation, which is not required to proof the friendship theorem. (Contributed by Alexander van der Vekens, 23-Dec-2017.) (Revised by AV, 10-May-2021.) |
| Ref | Expression |
|---|---|
| frgrncvvdeq.v1 | ⊢ 𝑉 = (Vtx‘𝐺) |
| frgrncvvdeq.e | ⊢ 𝐸 = (Edg‘𝐺) |
| frgrncvvdeq.nx | ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) |
| frgrncvvdeq.ny | ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) |
| frgrncvvdeq.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| frgrncvvdeq.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| frgrncvvdeq.ne | ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
| frgrncvvdeq.xy | ⊢ (𝜑 → 𝑌 ∉ 𝐷) |
| frgrncvvdeq.f | ⊢ (𝜑 → 𝐺 ∈ FriendGraph ) |
| frgrncvvdeq.a | ⊢ 𝐴 = (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸)) |
| Ref | Expression |
|---|---|
| frgrncvvdeqlem7 | ⊢ (𝜑 → ∀𝑥 ∈ 𝐷 (𝐴‘𝑥) ≠ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgrncvvdeq.v1 | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | frgrncvvdeq.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | frgrncvvdeq.nx | . . . 4 ⊢ 𝐷 = (𝐺 NeighbVtx 𝑋) | |
| 4 | frgrncvvdeq.ny | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑌) | |
| 5 | frgrncvvdeq.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 6 | frgrncvvdeq.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 7 | frgrncvvdeq.ne | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 𝑌) | |
| 8 | frgrncvvdeq.xy | . . . 4 ⊢ (𝜑 → 𝑌 ∉ 𝐷) | |
| 9 | frgrncvvdeq.f | . . . 4 ⊢ (𝜑 → 𝐺 ∈ FriendGraph ) | |
| 10 | frgrncvvdeq.a | . . . 4 ⊢ 𝐴 = (𝑥 ∈ 𝐷 ↦ (℩𝑦 ∈ 𝑁 {𝑥, 𝑦} ∈ 𝐸)) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | frgrncvvdeqlem5 30963 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → {(𝐴‘𝑥)} = ((𝐺 NeighbVtx 𝑥) ∩ 𝑁)) |
| 12 | fvex 6928 | . . . . 5 ⊢ (𝐴‘𝑥) ∈ V | |
| 13 | 12 | snid 4623 | . . . 4 ⊢ (𝐴‘𝑥) ∈ {(𝐴‘𝑥)} |
| 14 | eleq2 2856 | . . . . . 6 ⊢ ({(𝐴‘𝑥)} = ((𝐺 NeighbVtx 𝑥) ∩ 𝑁) → ((𝐴‘𝑥) ∈ {(𝐴‘𝑥)} ↔ (𝐴‘𝑥) ∈ ((𝐺 NeighbVtx 𝑥) ∩ 𝑁))) | |
| 15 | 14 | biimpa 482 | . . . . 5 ⊢ (({(𝐴‘𝑥)} = ((𝐺 NeighbVtx 𝑥) ∩ 𝑁) ∧ (𝐴‘𝑥) ∈ {(𝐴‘𝑥)}) → (𝐴‘𝑥) ∈ ((𝐺 NeighbVtx 𝑥) ∩ 𝑁)) |
| 16 | elin 4095 | . . . . . 6 ⊢ ((𝐴‘𝑥) ∈ ((𝐺 NeighbVtx 𝑥) ∩ 𝑁) ↔ ((𝐴‘𝑥) ∈ (𝐺 NeighbVtx 𝑥) ∧ (𝐴‘𝑥) ∈ 𝑁)) | |
| 17 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | frgrncvvdeqlem1 30959 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∉ 𝑁) |
| 18 | df-nel 3069 | . . . . . . . . . 10 ⊢ (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ 𝑁) | |
| 19 | nelelne 3063 | . . . . . . . . . 10 ⊢ (¬ 𝑋 ∈ 𝑁 → ((𝐴‘𝑥) ∈ 𝑁 → (𝐴‘𝑥) ≠ 𝑋)) | |
| 20 | 18, 19 | sylbi 220 | . . . . . . . . 9 ⊢ (𝑋 ∉ 𝑁 → ((𝐴‘𝑥) ∈ 𝑁 → (𝐴‘𝑥) ≠ 𝑋)) |
| 21 | 17, 20 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → ((𝐴‘𝑥) ∈ 𝑁 → (𝐴‘𝑥) ≠ 𝑋)) |
| 22 | 21 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝐴‘𝑥) ∈ 𝑁 → (𝐴‘𝑥) ≠ 𝑋)) |
| 23 | 22 | com12 33 | . . . . . 6 ⊢ ((𝐴‘𝑥) ∈ 𝑁 → ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ≠ 𝑋)) |
| 24 | 16, 23 | simplbiim 514 | . . . . 5 ⊢ ((𝐴‘𝑥) ∈ ((𝐺 NeighbVtx 𝑥) ∩ 𝑁) → ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ≠ 𝑋)) |
| 25 | 15, 24 | syl 18 | . . . 4 ⊢ (({(𝐴‘𝑥)} = ((𝐺 NeighbVtx 𝑥) ∩ 𝑁) ∧ (𝐴‘𝑥) ∈ {(𝐴‘𝑥)}) → ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ≠ 𝑋)) |
| 26 | 13, 25 | mpan2 704 | . . 3 ⊢ ({(𝐴‘𝑥)} = ((𝐺 NeighbVtx 𝑥) ∩ 𝑁) → ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ≠ 𝑋)) |
| 27 | 11, 26 | mpcom 39 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ≠ 𝑋) |
| 28 | 27 | ralrimiva 3161 | 1 ⊢ (𝜑 → ∀𝑥 ∈ 𝐷 (𝐴‘𝑥) ≠ 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ∉ wnel 3068 ∀wral 3083 ∩ cin 4091 {csn 4587 {cpr 4589 ↦ cmpt 5191 ‘cfv 6565 ℩crio 7406 (class class class)co 7450 Vtxcvtx 29633 Edgcedg 29684 NeighbVtx cnbgr 29972 FriendGraph cfrgr 30918 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-oadd 8517 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-fz 13679 df-hash 14515 df-edg 29685 df-upgr 29719 df-umgr 29720 df-usgr 29791 df-nbgr 29973 df-frgr 30919 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |