| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > strslfv2d | GIF version | ||
| Description: Deduction version of strslfv 13150. (Contributed by Mario Carneiro, 30-Apr-2015.) (Revised by Jim Kingdon, 30-Jan-2023.) |
| Ref | Expression |
|---|---|
| strslfv2d.e | ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ) |
| strfv2d.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| strfv2d.f | ⊢ (𝜑 → Fun ◡◡𝑆) |
| strfv2d.n | ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
| strfv2d.c | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| strslfv2d | ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | strslfv2d.e | . . . 4 ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ) | |
| 2 | 1 | simpli 111 | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) |
| 3 | strfv2d.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 4 | 1 | simpri 113 | . . . 4 ⊢ (𝐸‘ndx) ∈ ℕ |
| 5 | 4 | a1i 9 | . . 3 ⊢ (𝜑 → (𝐸‘ndx) ∈ ℕ) |
| 6 | 2, 3, 5 | strnfvnd 13125 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
| 7 | cnvcnv2 5192 | . . . 4 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
| 8 | 7 | fveq1i 5643 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
| 9 | 5 | elexd 2815 | . . . 4 ⊢ (𝜑 → (𝐸‘ndx) ∈ V) |
| 10 | fvres 5666 | . . . 4 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
| 11 | 9, 10 | syl 14 | . . 3 ⊢ (𝜑 → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) |
| 12 | 8, 11 | eqtrid 2275 | . 2 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) |
| 13 | strfv2d.f | . . 3 ⊢ (𝜑 → Fun ◡◡𝑆) | |
| 14 | strfv2d.n | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
| 15 | strfv2d.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 16 | 15 | elexd 2815 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ V) |
| 17 | 9, 16 | opelxpd 4760 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
| 18 | 14, 17 | elind 3391 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
| 19 | cnvcnv 5191 | . . . 4 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
| 20 | 18, 19 | eleqtrrdi 2324 | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
| 21 | funopfv 5686 | . . 3 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
| 22 | 13, 20, 21 | sylc 62 | . 2 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
| 23 | 6, 12, 22 | 3eqtr2rd 2270 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 Vcvv 2801 ∩ cin 3198 〈cop 3673 × cxp 4725 ◡ccnv 4726 ↾ cres 4729 Fun wfun 5322 ‘cfv 5328 ℕcn 9148 ndxcnx 13102 Slot cslot 13104 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-v 2803 df-sbc 3031 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-iota 5288 df-fun 5330 df-fv 5336 df-slot 13109 |
| This theorem is referenced by: strslfv2 13149 strslfv 13150 strslfv3 13151 opelstrsl 13220 |
| Copyright terms: Public domain | W3C validator |