Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > setsidvaldOLD | Structured version Visualization version GIF version |
Description: Obsolete version of setsidvald 16997 as of 17-Oct-2024. (Contributed by AV, 14-Mar-2020.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
setsidvaldOLD.e | ⊢ 𝐸 = Slot 𝑁 |
setsidvaldOLD.n | ⊢ 𝑁 ∈ ℕ |
setsidvaldOLD.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
setsidvaldOLD.f | ⊢ (𝜑 → Fun 𝑆) |
setsidvaldOLD.d | ⊢ (𝜑 → (𝐸‘ndx) ∈ dom 𝑆) |
Ref | Expression |
---|---|
setsidvaldOLD | ⊢ (𝜑 → 𝑆 = (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | setsidvaldOLD.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
2 | fvex 6842 | . . 3 ⊢ (𝐸‘𝑆) ∈ V | |
3 | setsval 16965 | . . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝐸‘𝑆) ∈ V) → (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉) = ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝐸‘𝑆)〉})) | |
4 | 1, 2, 3 | sylancl 587 | . 2 ⊢ (𝜑 → (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉) = ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝐸‘𝑆)〉})) |
5 | setsidvaldOLD.e | . . . . . . 7 ⊢ 𝐸 = Slot 𝑁 | |
6 | setsidvaldOLD.n | . . . . . . 7 ⊢ 𝑁 ∈ ℕ | |
7 | 5, 6 | ndxid 16995 | . . . . . 6 ⊢ 𝐸 = Slot (𝐸‘ndx) |
8 | 7, 1 | strfvnd 16983 | . . . . 5 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
9 | 8 | opeq2d 4828 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), (𝐸‘𝑆)〉 = 〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉) |
10 | 9 | sneqd 4589 | . . 3 ⊢ (𝜑 → {〈(𝐸‘ndx), (𝐸‘𝑆)〉} = {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉}) |
11 | 10 | uneq2d 4114 | . 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝐸‘𝑆)〉}) = ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉})) |
12 | setsidvaldOLD.f | . . 3 ⊢ (𝜑 → Fun 𝑆) | |
13 | setsidvaldOLD.d | . . 3 ⊢ (𝜑 → (𝐸‘ndx) ∈ dom 𝑆) | |
14 | funresdfunsn 7121 | . . 3 ⊢ ((Fun 𝑆 ∧ (𝐸‘ndx) ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉}) = 𝑆) | |
15 | 12, 13, 14 | syl2anc 585 | . 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉}) = 𝑆) |
16 | 4, 11, 15 | 3eqtrrd 2782 | 1 ⊢ (𝜑 → 𝑆 = (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 Vcvv 3442 ∖ cdif 3898 ∪ cun 3899 {csn 4577 〈cop 4583 dom cdm 5624 ↾ cres 5626 Fun wfun 6477 ‘cfv 6483 (class class class)co 7341 ℕcn 12078 sSet csts 16961 Slot cslot 16979 ndxcnx 16991 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5247 ax-nul 5254 ax-pow 5312 ax-pr 5376 ax-un 7654 ax-cnex 11032 ax-1cn 11034 ax-addcl 11036 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3351 df-rab 3405 df-v 3444 df-sbc 3731 df-csb 3847 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3920 df-nul 4274 df-if 4478 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4857 df-iun 4947 df-br 5097 df-opab 5159 df-mpt 5180 df-tr 5214 df-id 5522 df-eprel 5528 df-po 5536 df-so 5537 df-fr 5579 df-we 5581 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6242 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6435 df-fun 6485 df-fn 6486 df-f 6487 df-f1 6488 df-fo 6489 df-f1o 6490 df-fv 6491 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7785 df-2nd 7904 df-frecs 8171 df-wrecs 8202 df-recs 8276 df-rdg 8315 df-nn 12079 df-sets 16962 df-slot 16980 df-ndx 16992 |
This theorem is referenced by: ressval3dOLD 17054 |
Copyright terms: Public domain | W3C validator |