Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > strslfv2d | GIF version |
Description: Deduction version of strslfv 12194. (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 110 | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) |
3 | strfv2d.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
4 | 1 | simpri 112 | . . . 4 ⊢ (𝐸‘ndx) ∈ ℕ |
5 | 4 | a1i 9 | . . 3 ⊢ (𝜑 → (𝐸‘ndx) ∈ ℕ) |
6 | 2, 3, 5 | strnfvnd 12170 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
7 | cnvcnv2 5036 | . . . 4 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
8 | 7 | fveq1i 5466 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
9 | 5 | elexd 2725 | . . . 4 ⊢ (𝜑 → (𝐸‘ndx) ∈ V) |
10 | fvres 5489 | . . . 4 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
11 | 9, 10 | syl 14 | . . 3 ⊢ (𝜑 → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) |
12 | 8, 11 | syl5eq 2202 | . 2 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) |
13 | strfv2d.f | . . 3 ⊢ (𝜑 → Fun ◡◡𝑆) | |
14 | strfv2d.n | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
15 | strfv2d.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
16 | 15 | elexd 2725 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ V) |
17 | 9, 16 | opelxpd 4616 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
18 | 14, 17 | elind 3292 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
19 | cnvcnv 5035 | . . . 4 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
20 | 18, 19 | eleqtrrdi 2251 | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
21 | funopfv 5505 | . . 3 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
22 | 13, 20, 21 | sylc 62 | . 2 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
23 | 6, 12, 22 | 3eqtr2rd 2197 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1335 ∈ wcel 2128 Vcvv 2712 ∩ cin 3101 〈cop 3563 × cxp 4581 ◡ccnv 4582 ↾ cres 4585 Fun wfun 5161 ‘cfv 5167 ℕcn 8816 ndxcnx 12147 Slot cslot 12149 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-sep 4082 ax-pow 4134 ax-pr 4168 ax-un 4392 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ral 2440 df-rex 2441 df-v 2714 df-sbc 2938 df-un 3106 df-in 3108 df-ss 3115 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-br 3966 df-opab 4026 df-mpt 4027 df-id 4252 df-xp 4589 df-rel 4590 df-cnv 4591 df-co 4592 df-dm 4593 df-rn 4594 df-res 4595 df-iota 5132 df-fun 5169 df-fv 5175 df-slot 12154 |
This theorem is referenced by: strslfv2 12193 strslfv 12194 opelstrsl 12246 |
Copyright terms: Public domain | W3C validator |