| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cusgrexilem2 | Structured version Visualization version GIF version | ||
| Description: Lemma 2 for cusgrexi 29771. (Contributed by AV, 12-Jan-2018.) (Revised by AV, 10-Nov-2021.) |
| Ref | Expression |
|---|---|
| usgrexi.p | ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| Ref | Expression |
|---|---|
| cusgrexilem2 | ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 489 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ 𝑉) | |
| 2 | eldifi 4086 | . . . 4 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛 ∈ 𝑉) | |
| 3 | prelpwi 5430 | . . . 4 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → {𝑣, 𝑛} ∈ 𝒫 𝑉) | |
| 4 | 1, 2, 3 | syl2an 607 | . . 3 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ∈ 𝒫 𝑉) |
| 5 | eldifsni 4759 | . . . . . 6 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛 ≠ 𝑣) | |
| 6 | 5 | necomd 3013 | . . . . 5 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑣 ≠ 𝑛) |
| 7 | 6 | adantl 486 | . . . 4 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣 ≠ 𝑛) |
| 8 | hashprg 14433 | . . . . 5 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → (𝑣 ≠ 𝑛 ↔ (♯‘{𝑣, 𝑛}) = 2)) | |
| 9 | 1, 2, 8 | syl2an 607 | . . . 4 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑣 ≠ 𝑛 ↔ (♯‘{𝑣, 𝑛}) = 2)) |
| 10 | 7, 9 | mpbid 235 | . . 3 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (♯‘{𝑣, 𝑛}) = 2) |
| 11 | fveqeq2 6892 | . . . 4 ⊢ (𝑥 = {𝑣, 𝑛} → ((♯‘𝑥) = 2 ↔ (♯‘{𝑣, 𝑛}) = 2)) | |
| 12 | rnresi 6079 | . . . . 5 ⊢ ran ( I ↾ 𝑃) = 𝑃 | |
| 13 | usgrexi.p | . . . . 5 ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} | |
| 14 | 12, 13 | eqtri 2786 | . . . 4 ⊢ ran ( I ↾ 𝑃) = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| 15 | 11, 14 | elrab2 3655 | . . 3 ⊢ ({𝑣, 𝑛} ∈ ran ( I ↾ 𝑃) ↔ ({𝑣, 𝑛} ∈ 𝒫 𝑉 ∧ (♯‘{𝑣, 𝑛}) = 2)) |
| 16 | 4, 10, 15 | sylanbrc 594 | . 2 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ∈ ran ( I ↾ 𝑃)) |
| 17 | sseq2 3964 | . . 3 ⊢ (𝑒 = {𝑣, 𝑛} → ({𝑣, 𝑛} ⊆ 𝑒 ↔ {𝑣, 𝑛} ⊆ {𝑣, 𝑛})) | |
| 18 | 17 | adantl 486 | . 2 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) ∧ 𝑒 = {𝑣, 𝑛}) → ({𝑣, 𝑛} ⊆ 𝑒 ↔ {𝑣, 𝑛} ⊆ {𝑣, 𝑛})) |
| 19 | ssidd 3961 | . 2 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ⊆ {𝑣, 𝑛}) | |
| 20 | 16, 18, 19 | rspcedvd 3584 | 1 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∃wrex 3089 {crab 3416 ∖ cdif 3903 ⊆ wss 3906 𝒫 cpw 4563 {csn 4590 {cpr 4592 I cid 5557 ran crn 5664 ↾ cres 5665 ‘cfv 6538 2c2 12296 ♯chash 14368 |
| 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-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 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-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-oadd 8458 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-dju 9888 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-n0 12506 df-z 12593 df-uz 12864 df-fz 13537 df-hash 14369 |
| This theorem is referenced by: cusgrexi 29771 structtocusgr 29774 |
| Copyright terms: Public domain | W3C validator |