| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 4cycl2v2nb | Structured version Visualization version GIF version | ||
| Description: In a (maybe degenerate) 4-cycle, two vertice have two (maybe not different) common neighbors. (Contributed by Alexander van der Vekens, 19-Nov-2017.) (Revised by AV, 2-Apr-2021.) |
| Ref | Expression |
|---|---|
| 4cycl2v2nb | ⊢ ((({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ∧ ({𝐶, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐴} ∈ 𝐸)) → ({{𝐴, 𝐵}, {𝐵, 𝐶}} ⊆ 𝐸 ∧ {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prssi 4787 | . 2 ⊢ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → {{𝐴, 𝐵}, {𝐵, 𝐶}} ⊆ 𝐸) | |
| 2 | prcom 4698 | . . . . 5 ⊢ {𝐷, 𝐴} = {𝐴, 𝐷} | |
| 3 | 2 | eleq1i 2854 | . . . 4 ⊢ ({𝐷, 𝐴} ∈ 𝐸 ↔ {𝐴, 𝐷} ∈ 𝐸) |
| 4 | 3 | biimpi 219 | . . 3 ⊢ ({𝐷, 𝐴} ∈ 𝐸 → {𝐴, 𝐷} ∈ 𝐸) |
| 5 | prcom 4698 | . . . . 5 ⊢ {𝐶, 𝐷} = {𝐷, 𝐶} | |
| 6 | 5 | eleq1i 2854 | . . . 4 ⊢ ({𝐶, 𝐷} ∈ 𝐸 ↔ {𝐷, 𝐶} ∈ 𝐸) |
| 7 | 6 | biimpi 219 | . . 3 ⊢ ({𝐶, 𝐷} ∈ 𝐸 → {𝐷, 𝐶} ∈ 𝐸) |
| 8 | prssi 4787 | . . 3 ⊢ (({𝐴, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐶} ∈ 𝐸) → {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸) | |
| 9 | 4, 7, 8 | syl2anr 608 | . 2 ⊢ (({𝐶, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐴} ∈ 𝐸) → {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸) |
| 10 | 1, 9 | anim12i 624 | 1 ⊢ ((({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ∧ ({𝐶, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐴} ∈ 𝐸)) → ({{𝐴, 𝐵}, {𝐵, 𝐶}} ⊆ 𝐸 ∧ {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2143 ⊆ wss 3905 {cpr 4591 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 df-un 3910 df-ss 3922 df-sn 4590 df-pr 4592 |
| This theorem is referenced by: 4cycl2vnunb 30641 |
| Copyright terms: Public domain | W3C validator |