| 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 29516. (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 6883 | . . 3 ⊢ 𝑉 ∈ V |
| 3 | 2 | difexi 5288 | . 2 ⊢ (𝑉 ∖ {𝑁}) ∈ V |
| 4 | upgrres1.f | . . . 4 ⊢ 𝐹 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∉ 𝑒} | |
| 5 | upgrres1.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 6 | 5 | fvexi 6883 | . . . 4 ⊢ 𝐸 ∈ V |
| 7 | 4, 6 | rabex2 5299 | . . 3 ⊢ 𝐹 ∈ V |
| 8 | resiexg 7895 | . . 3 ⊢ (𝐹 ∈ V → ( I ↾ 𝐹) ∈ V) | |
| 9 | 7, 8 | ax-mp 5 | . 2 ⊢ ( I ↾ 𝐹) ∈ V |
| 10 | 3, 9 | pm3.2i 474 | 1 ⊢ ((𝑉 ∖ {𝑁}) ∈ V ∧ ( I ↾ 𝐹) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 399 = wceq 1562 ∈ wcel 2144 ∉ wnel 3063 {crab 3416 Vcvv 3456 ∖ cdif 3903 {csn 4584 I cid 5543 ↾ cres 5651 ‘cfv 6523 Vtxcvtx 29199 Edgcedg 29250 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-id 5544 df-xp 5655 df-rel 5656 df-res 5661 df-iota 6479 df-fv 6531 |
| This theorem is referenced by: upgrres1lem2 29514 upgrres1lem3 29515 |
| Copyright terms: Public domain | W3C validator |