Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > strslfv2d | GIF version |
Description: Deduction version of strslfv 12006. (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 11982 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
7 | cnvcnv2 4992 | . . . 4 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
8 | 7 | fveq1i 5422 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
9 | 5 | elexd 2699 | . . . 4 ⊢ (𝜑 → (𝐸‘ndx) ∈ V) |
10 | fvres 5445 | . . . 4 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
11 | 9, 10 | syl 14 | . . 3 ⊢ (𝜑 → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) |
12 | 8, 11 | syl5eq 2184 | . 2 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) |
13 | strfv2d.f | . . 3 ⊢ (𝜑 → Fun ◡◡𝑆) | |
14 | strfv2d.n | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
15 | strfv2d.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
16 | 15 | elexd 2699 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ V) |
17 | 9, 16 | opelxpd 4572 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
18 | 14, 17 | elind 3261 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
19 | cnvcnv 4991 | . . . 4 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
20 | 18, 19 | eleqtrrdi 2233 | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
21 | funopfv 5461 | . . 3 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
22 | 13, 20, 21 | sylc 62 | . 2 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
23 | 6, 12, 22 | 3eqtr2rd 2179 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 Vcvv 2686 ∩ cin 3070 〈cop 3530 × cxp 4537 ◡ccnv 4538 ↾ cres 4541 Fun wfun 5117 ‘cfv 5123 ℕcn 8723 ndxcnx 11959 Slot cslot 11961 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-sbc 2910 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-iota 5088 df-fun 5125 df-fv 5131 df-slot 11966 |
This theorem is referenced by: strslfv2 12005 strslfv 12006 opelstrsl 12058 |
Copyright terms: Public domain | W3C validator |