| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frcond2 | Structured version Visualization version GIF version | ||
| Description: The friendship condition: any two (different) vertices in a friendship graph have a unique common neighbor. (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 29-Mar-2021.) |
| Ref | Expression |
|---|---|
| frcond1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| frcond1.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| frcond2 | ⊢ (𝐺 ∈ FriendGraph → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → ∃!𝑏 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frcond1.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | frcond1.e | . . 3 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | frcond1 30557 | . 2 ⊢ (𝐺 ∈ FriendGraph → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → ∃!𝑏 ∈ 𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)) |
| 4 | prex 5410 | . . . . 5 ⊢ {𝐴, 𝑏} ∈ V | |
| 5 | prex 5410 | . . . . 5 ⊢ {𝑏, 𝐶} ∈ V | |
| 6 | 4, 5 | prss 4790 | . . . 4 ⊢ (({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸) ↔ {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸) |
| 7 | 6 | bicomi 227 | . . 3 ⊢ ({{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸 ↔ ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)) |
| 8 | 7 | reubii 3385 | . 2 ⊢ (∃!𝑏 ∈ 𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸 ↔ ∃!𝑏 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸)) |
| 9 | 3, 8 | imbitrdi 254 | 1 ⊢ (𝐺 ∈ FriendGraph → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → ∃!𝑏 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝐶} ∈ 𝐸))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∃!wreu 3374 ⊆ wss 3913 {cpr 4596 ‘cfv 6537 Vtxcvtx 29286 Edgcedg 29337 FriendGraph cfrgr 30549 |
| 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-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 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-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 df-frgr 30550 |
| This theorem is referenced by: frgreu 30559 frgrncvvdeqlem9 30598 frgr2wwlkeu 30618 numclwwlk2lem1 30667 |
| Copyright terms: Public domain | W3C validator |