| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > upgrres1lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for upgrres1 29633. (Contributed by AV, 7-Nov-2020.) |
| Ref | Expression |
|---|---|
| upgrres1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| upgrres1.e | ⊢ 𝐸 = (Edg‘𝐺) |
| upgrres1.f | ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} |
| Ref | Expression |
|---|---|
| upgrres1lem1 | ⊢ ((𝑉 ∖ {𝑁}) ∈ V ∧ ( I ↾ 𝐹) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgrres1.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | fvexi 6899 | . . 3 ⊢ 𝑉 ∈ V |
| 3 | 2 | difexi 5304 | . 2 ⊢ (𝑉 ∖ {𝑁}) ∈ V |
| 4 | upgrres1.f | . . . 4 ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} | |
| 5 | upgrres1.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 6 | 5 | fvexi 6899 | . . . 4 ⊢ 𝐸 ∈ V |
| 7 | 4, 6 | rabex2 5315 | . . 3 ⊢ 𝐹 ∈ V |
| 8 | resiexg 7912 | . . 3 ⊢ (𝐹 ∈ V → ( I ↾ 𝐹) ∈ V) | |
| 9 | 7, 8 | ax-mp 5 | . 2 ⊢ ( I ↾ 𝐹) ∈ V |
| 10 | 3, 9 | pm3.2i 475 | 1 ⊢ ((𝑉 ∖ {𝑁}) ∈ V ∧ ( I ↾ 𝐹) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 = wceq 1568 ∈ wcel 2150 ∉ wnel 3071 {crab 3423 Vcvv 3462 ∖ cdif 3910 {csn 4594 I cid 5559 ↾ cres 5667 ‘cfv 6540 Vtxcvtx 29316 Edgcedg 29367 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-id 5560 df-xp 5671 df-rel 5672 df-res 5677 df-iota 6496 df-fv 6548 |
| This theorem is referenced by: upgrres1lem2 29631 upgrres1lem3 29632 |
| Copyright terms: Public domain | W3C validator |