| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscplgrnb | Structured version Visualization version GIF version | ||
| Description: A graph is complete iff all vertices are neighbors of all vertices. (Contributed by AV, 1-Nov-2020.) |
| Ref | Expression |
|---|---|
| cplgruvtxb.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| iscplgrnb | ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣 ∈ 𝑉 ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cplgruvtxb.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | iscplgr 29746 | . 2 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺))) |
| 3 | 1 | uvtxel 29719 | . . . . 5 ⊢ (𝑣 ∈ (UnivVtx‘𝐺) ↔ (𝑣 ∈ 𝑉 ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 4 | 3 | a1i 11 | . . . 4 ⊢ (𝐺 ∈ 𝑊 → (𝑣 ∈ (UnivVtx‘𝐺) ↔ (𝑣 ∈ 𝑉 ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))) |
| 5 | 4 | baibd 548 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → (𝑣 ∈ (UnivVtx‘𝐺) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 6 | 5 | ralbidva 3186 | . 2 ⊢ (𝐺 ∈ 𝑊 → (∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺) ↔ ∀𝑣 ∈ 𝑉 ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| 7 | 2, 6 | bitrd 282 | 1 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ ComplGraph ↔ ∀𝑣 ∈ 𝑉 ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ∖ cdif 3903 {csn 4590 ‘cfv 6538 (class class class)co 7412 Vtxcvtx 29327 NeighbVtx cnbgr 29663 UnivVtxcuvtx 29716 ComplGraphccplgr 29740 |
| 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-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7415 df-uvtx 29717 df-cplgr 29742 |
| This theorem is referenced by: iscplgredg 29748 iscusgredg 29754 cplgr3v 29766 |
| Copyright terms: Public domain | W3C validator |