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 16803 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 6766 | . . 3 ⊢ (𝐸‘𝑆) ∈ V | |
3 | setsval 16771 | . . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ (𝐸‘𝑆) ∈ V) → (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉) = ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝐸‘𝑆)〉})) | |
4 | 1, 2, 3 | sylancl 589 | . 2 ⊢ (𝜑 → (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉) = ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝐸‘𝑆)〉})) |
5 | setsidvaldOLD.e | . . . . . . 7 ⊢ 𝐸 = Slot 𝑁 | |
6 | setsidvaldOLD.n | . . . . . . 7 ⊢ 𝑁 ∈ ℕ | |
7 | 5, 6 | ndxid 16801 | . . . . . 6 ⊢ 𝐸 = Slot (𝐸‘ndx) |
8 | 7, 1 | strfvnd 16789 | . . . . 5 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
9 | 8 | opeq2d 4808 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), (𝐸‘𝑆)〉 = 〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉) |
10 | 9 | sneqd 4570 | . . 3 ⊢ (𝜑 → {〈(𝐸‘ndx), (𝐸‘𝑆)〉} = {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉}) |
11 | 10 | uneq2d 4094 | . 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝐸‘𝑆)〉}) = ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉})) |
12 | setsidvaldOLD.f | . . 3 ⊢ (𝜑 → Fun 𝑆) | |
13 | setsidvaldOLD.d | . . 3 ⊢ (𝜑 → (𝐸‘ndx) ∈ dom 𝑆) | |
14 | funresdfunsn 7040 | . . 3 ⊢ ((Fun 𝑆 ∧ (𝐸‘ndx) ∈ dom 𝑆) → ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉}) = 𝑆) | |
15 | 12, 13, 14 | syl2anc 587 | . 2 ⊢ (𝜑 → ((𝑆 ↾ (V ∖ {(𝐸‘ndx)})) ∪ {〈(𝐸‘ndx), (𝑆‘(𝐸‘ndx))〉}) = 𝑆) |
16 | 4, 11, 15 | 3eqtrrd 2784 | 1 ⊢ (𝜑 → 𝑆 = (𝑆 sSet 〈(𝐸‘ndx), (𝐸‘𝑆)〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2112 Vcvv 3423 ∖ cdif 3881 ∪ cun 3882 {csn 4558 〈cop 4564 dom cdm 5579 ↾ cres 5581 Fun wfun 6409 ‘cfv 6415 (class class class)co 7252 ℕcn 11878 sSet csts 16767 Slot cslot 16785 ndxcnx 16797 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2710 ax-sep 5216 ax-nul 5223 ax-pow 5282 ax-pr 5346 ax-un 7563 ax-cnex 10833 ax-1cn 10835 ax-addcl 10837 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2818 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3071 df-rab 3073 df-v 3425 df-sbc 3713 df-csb 3830 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3903 df-nul 4255 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5153 df-tr 5186 df-id 5479 df-eprel 5485 df-po 5493 df-so 5494 df-fr 5534 df-we 5536 df-xp 5585 df-rel 5586 df-cnv 5587 df-co 5588 df-dm 5589 df-rn 5590 df-res 5591 df-ima 5592 df-pred 6189 df-ord 6251 df-on 6252 df-lim 6253 df-suc 6254 df-iota 6373 df-fun 6417 df-fn 6418 df-f 6419 df-f1 6420 df-fo 6421 df-f1o 6422 df-fv 6423 df-ov 7255 df-oprab 7256 df-mpo 7257 df-om 7685 df-wrecs 8089 df-recs 8150 df-rdg 8188 df-nn 11879 df-sets 16768 df-slot 16786 df-ndx 16798 |
This theorem is referenced by: ressval3dOLD 16858 |
Copyright terms: Public domain | W3C validator |