| 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 4789 | . 2 ⊢ (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → {{𝐴, 𝐵}, {𝐵, 𝐶}} ⊆ 𝐸) | |
| 2 | prcom 4700 | . . . . 5 ⊢ {𝐷, 𝐴} = {𝐴, 𝐷} | |
| 3 | 2 | eleq1i 2856 | . . . 4 ⊢ ({𝐷, 𝐴} ∈ 𝐸 ↔ {𝐴, 𝐷} ∈ 𝐸) |
| 4 | 3 | biimpi 219 | . . 3 ⊢ ({𝐷, 𝐴} ∈ 𝐸 → {𝐴, 𝐷} ∈ 𝐸) |
| 5 | prcom 4700 | . . . . 5 ⊢ {𝐶, 𝐷} = {𝐷, 𝐶} | |
| 6 | 5 | eleq1i 2856 | . . . 4 ⊢ ({𝐶, 𝐷} ∈ 𝐸 ↔ {𝐷, 𝐶} ∈ 𝐸) |
| 7 | 6 | biimpi 219 | . . 3 ⊢ ({𝐶, 𝐷} ∈ 𝐸 → {𝐷, 𝐶} ∈ 𝐸) |
| 8 | prssi 4789 | . . 3 ⊢ (({𝐴, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐶} ∈ 𝐸) → {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸) | |
| 9 | 4, 7, 8 | syl2anr 609 | . 2 ⊢ (({𝐶, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐴} ∈ 𝐸) → {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸) |
| 10 | 1, 9 | anim12i 625 | 1 ⊢ ((({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ∧ ({𝐶, 𝐷} ∈ 𝐸 ∧ {𝐷, 𝐴} ∈ 𝐸)) → ({{𝐴, 𝐵}, {𝐵, 𝐶}} ⊆ 𝐸 ∧ {{𝐴, 𝐷}, {𝐷, 𝐶}} ⊆ 𝐸)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2146 ⊆ wss 3906 {cpr 4593 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3911 df-ss 3923 df-sn 4592 df-pr 4594 |
| This theorem is used by: 4cycl2vnunb 30712 |
| Copyright terms: Public domain | W3C validator |