| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nbgr0edglem | Structured version Visualization version GIF version | ||
| Description: Lemma for nbgr0edg 29442 and nbgr1vtx 29443. (Contributed by AV, 15-Nov-2020.) |
| Ref | Expression |
|---|---|
| nbgr0edglem.v | ⊢ (𝜑 → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒) |
| Ref | Expression |
|---|---|
| nbgr0edglem | ⊢ (𝜑 → (𝐺 NeighbVtx 𝐾) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . . . . . . 8 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2737 | . . . . . . . 8 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 3 | 1, 2 | nbgrval 29421 | . . . . . . 7 ⊢ (𝐾 ∈ (Vtx‘𝐺) → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒}) |
| 4 | 3 | ad2antrl 729 | . . . . . 6 ⊢ (((𝐺 ∈ V ∧ 𝐾 ∈ V) ∧ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝜑)) → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒}) |
| 5 | nbgr0edglem.v | . . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒) | |
| 6 | 5 | ad2antll 730 | . . . . . . 7 ⊢ (((𝐺 ∈ V ∧ 𝐾 ∈ V) ∧ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝜑)) → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒) |
| 7 | rabeq0 4342 | . . . . . . 7 ⊢ ({𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒} = ∅ ↔ ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒) | |
| 8 | 6, 7 | sylibr 234 | . . . . . 6 ⊢ (((𝐺 ∈ V ∧ 𝐾 ∈ V) ∧ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝜑)) → {𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ∣ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒} = ∅) |
| 9 | 4, 8 | eqtrd 2772 | . . . . 5 ⊢ (((𝐺 ∈ V ∧ 𝐾 ∈ V) ∧ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝜑)) → (𝐺 NeighbVtx 𝐾) = ∅) |
| 10 | 9 | expcom 413 | . . . 4 ⊢ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝜑) → ((𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝐺 NeighbVtx 𝐾) = ∅)) |
| 11 | 10 | ex 412 | . . 3 ⊢ (𝐾 ∈ (Vtx‘𝐺) → (𝜑 → ((𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝐺 NeighbVtx 𝐾) = ∅))) |
| 12 | 11 | com23 86 | . 2 ⊢ (𝐾 ∈ (Vtx‘𝐺) → ((𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝜑 → (𝐺 NeighbVtx 𝐾) = ∅))) |
| 13 | df-nel 3038 | . . . 4 ⊢ (𝐾 ∉ (Vtx‘𝐺) ↔ ¬ 𝐾 ∈ (Vtx‘𝐺)) | |
| 14 | 1 | nbgrnvtx0 29424 | . . . 4 ⊢ (𝐾 ∉ (Vtx‘𝐺) → (𝐺 NeighbVtx 𝐾) = ∅) |
| 15 | 13, 14 | sylbir 235 | . . 3 ⊢ (¬ 𝐾 ∈ (Vtx‘𝐺) → (𝐺 NeighbVtx 𝐾) = ∅) |
| 16 | 15 | a1d 25 | . 2 ⊢ (¬ 𝐾 ∈ (Vtx‘𝐺) → (𝜑 → (𝐺 NeighbVtx 𝐾) = ∅)) |
| 17 | nbgrprc0 29419 | . . 3 ⊢ (¬ (𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝐺 NeighbVtx 𝐾) = ∅) | |
| 18 | 17 | a1d 25 | . 2 ⊢ (¬ (𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝜑 → (𝐺 NeighbVtx 𝐾) = ∅)) |
| 19 | 12, 16, 18 | pm2.61nii 184 | 1 ⊢ (𝜑 → (𝐺 NeighbVtx 𝐾) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∉ wnel 3037 ∀wral 3052 ∃wrex 3062 {crab 3401 Vcvv 3442 ∖ cdif 3900 ⊆ wss 3903 ∅c0 4287 {csn 4582 {cpr 4584 ‘cfv 6500 (class class class)co 7368 Vtxcvtx 29081 Edgcedg 29132 NeighbVtx cnbgr 29417 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-nbgr 29418 |
| This theorem is referenced by: nbgr0edg 29442 nbgr1vtx 29443 |
| Copyright terms: Public domain | W3C validator |