![]() |
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 29475. (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 484 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ 𝑉) | |
2 | eldifi 4141 | . . . 4 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛 ∈ 𝑉) | |
3 | prelpwi 5458 | . . . 4 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → {𝑣, 𝑛} ∈ 𝒫 𝑉) | |
4 | 1, 2, 3 | syl2an 596 | . . 3 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ∈ 𝒫 𝑉) |
5 | eldifsni 4795 | . . . . . 6 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛 ≠ 𝑣) | |
6 | 5 | necomd 2994 | . . . . 5 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑣 ≠ 𝑛) |
7 | 6 | adantl 481 | . . . 4 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣 ≠ 𝑛) |
8 | hashprg 14431 | . . . . 5 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → (𝑣 ≠ 𝑛 ↔ (♯‘{𝑣, 𝑛}) = 2)) | |
9 | 1, 2, 8 | syl2an 596 | . . . 4 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑣 ≠ 𝑛 ↔ (♯‘{𝑣, 𝑛}) = 2)) |
10 | 7, 9 | mpbid 232 | . . 3 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (♯‘{𝑣, 𝑛}) = 2) |
11 | fveqeq2 6916 | . . . 4 ⊢ (𝑥 = {𝑣, 𝑛} → ((♯‘𝑥) = 2 ↔ (♯‘{𝑣, 𝑛}) = 2)) | |
12 | rnresi 6095 | . . . . 5 ⊢ ran ( I ↾ 𝑃) = 𝑃 | |
13 | usgrexi.p | . . . . 5 ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} | |
14 | 12, 13 | eqtri 2763 | . . . 4 ⊢ ran ( I ↾ 𝑃) = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
15 | 11, 14 | elrab2 3698 | . . 3 ⊢ ({𝑣, 𝑛} ∈ ran ( I ↾ 𝑃) ↔ ({𝑣, 𝑛} ∈ 𝒫 𝑉 ∧ (♯‘{𝑣, 𝑛}) = 2)) |
16 | 4, 10, 15 | sylanbrc 583 | . 2 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ∈ ran ( I ↾ 𝑃)) |
17 | sseq2 4022 | . . 3 ⊢ (𝑒 = {𝑣, 𝑛} → ({𝑣, 𝑛} ⊆ 𝑒 ↔ {𝑣, 𝑛} ⊆ {𝑣, 𝑛})) | |
18 | 17 | adantl 481 | . 2 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) ∧ 𝑒 = {𝑣, 𝑛}) → ({𝑣, 𝑛} ⊆ 𝑒 ↔ {𝑣, 𝑛} ⊆ {𝑣, 𝑛})) |
19 | ssidd 4019 | . 2 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ⊆ {𝑣, 𝑛}) | |
20 | 16, 18, 19 | rspcedvd 3624 | 1 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∃wrex 3068 {crab 3433 ∖ cdif 3960 ⊆ wss 3963 𝒫 cpw 4605 {csn 4631 {cpr 4633 I cid 5582 ran crn 5690 ↾ cres 5691 ‘cfv 6563 2c2 12319 ♯chash 14366 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-oadd 8509 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-dju 9939 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-hash 14367 |
This theorem is referenced by: cusgrexi 29475 structtocusgr 29478 |
Copyright terms: Public domain | W3C validator |