| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > strslfv3 | GIF version | ||
| Description: Variant on strslfv 13380 for large structures. (Contributed by Mario Carneiro, 10-Jan-2017.) (Revised by Jim Kingdon, 30-Jan-2023.) |
| Ref | Expression |
|---|---|
| strfv3.u | ⊢ (𝜑 → 𝑈 = 𝑆) |
| strslfv3.s | ⊢ (𝜑 → 𝑆 Struct 𝑋) |
| strslfv3.e | ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ) |
| strslfv3.n | ⊢ (𝜑 → {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆) |
| strfv3.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| strfv3.a | ⊢ 𝐴 = (𝐸‘𝑈) |
| Ref | Expression |
|---|---|
| strslfv3 | ⊢ (𝜑 → 𝐴 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | strfv3.a | . 2 ⊢ 𝐴 = (𝐸‘𝑈) | |
| 2 | strslfv3.e | . . 3 ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ) | |
| 3 | strfv3.u | . . . 4 ⊢ (𝜑 → 𝑈 = 𝑆) | |
| 4 | strslfv3.s | . . . . 5 ⊢ (𝜑 → 𝑆 Struct 𝑋) | |
| 5 | structex 13347 | . . . . 5 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 7 | 3, 6 | eqeltrd 2315 | . . 3 ⊢ (𝜑 → 𝑈 ∈ V) |
| 8 | structfung 13352 | . . . . 5 ⊢ (𝑆 Struct 𝑋 → Fun ◡◡𝑆) | |
| 9 | 4, 8 | syl 14 | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) |
| 10 | 3 | cnveqd 4954 | . . . . . 6 ⊢ (𝜑 → ◡𝑈 = ◡𝑆) |
| 11 | 10 | cnveqd 4954 | . . . . 5 ⊢ (𝜑 → ◡◡𝑈 = ◡◡𝑆) |
| 12 | 11 | funeqd 5397 | . . . 4 ⊢ (𝜑 → (Fun ◡◡𝑈 ↔ Fun ◡◡𝑆)) |
| 13 | 9, 12 | mpbird 167 | . . 3 ⊢ (𝜑 → Fun ◡◡𝑈) |
| 14 | strslfv3.n | . . . . 5 ⊢ (𝜑 → {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆) | |
| 15 | 2 | simpri 113 | . . . . . . 7 ⊢ (𝐸‘ndx) ∈ ℕ |
| 16 | strfv3.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 17 | opexg 4366 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ ℕ ∧ 𝐶 ∈ 𝑉) → 〈(𝐸‘ndx), 𝐶〉 ∈ V) | |
| 18 | 15, 16, 17 | sylancr 418 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ V) |
| 19 | snssg 3847 | . . . . . 6 ⊢ (〈(𝐸‘ndx), 𝐶〉 ∈ V → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 ↔ {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆)) | |
| 20 | 18, 19 | syl 14 | . . . . 5 ⊢ (𝜑 → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 ↔ {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆)) |
| 21 | 14, 20 | mpbird 167 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
| 22 | 21, 3 | eleqtrrd 2318 | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑈) |
| 23 | 2, 7, 13, 22, 16 | strslfv2d 13378 | . 2 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑈)) |
| 24 | 1, 23 | eqtr4id 2290 | 1 ⊢ (𝜑 → 𝐴 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ⊆ wss 3220 {csn 3708 〈cop 3711 class class class wbr 4128 ◡ccnv 4771 Fun wfun 5369 ‘cfv 5375 ℕcn 9287 Struct cstr 13331 ndxcnx 13332 Slot cslot 13334 |
| 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-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-iota 5335 df-fun 5377 df-fv 5383 df-struct 13337 df-slot 13339 |
| This theorem is referenced by: prdsbaslemss 14157 |
| Copyright terms: Public domain | W3C validator |