| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > strslfv3 | GIF version | ||
| Description: Variant on strslfv 12921 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 12888 | . . . . 5 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 7 | 3, 6 | eqeltrd 2283 | . . 3 ⊢ (𝜑 → 𝑈 ∈ V) |
| 8 | structfung 12893 | . . . . 5 ⊢ (𝑆 Struct 𝑋 → Fun ◡◡𝑆) | |
| 9 | 4, 8 | syl 14 | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) |
| 10 | 3 | cnveqd 4858 | . . . . . 6 ⊢ (𝜑 → ◡𝑈 = ◡𝑆) |
| 11 | 10 | cnveqd 4858 | . . . . 5 ⊢ (𝜑 → ◡◡𝑈 = ◡◡𝑆) |
| 12 | 11 | funeqd 5298 | . . . 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 4276 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ ℕ ∧ 𝐶 ∈ 𝑉) → 〈(𝐸‘ndx), 𝐶〉 ∈ V) | |
| 18 | 15, 16, 17 | sylancr 414 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ V) |
| 19 | snssg 3769 | . . . . . 6 ⊢ (〈(𝐸‘ndx), 𝐶〉 ∈ V → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 ↔ {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆)) | |
| 20 | 18, 19 | syl 14 | . . . . 5 ⊢ (𝜑 → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 ↔ {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆)) |
| 21 | 14, 20 | mpbird 167 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
| 22 | 21, 3 | eleqtrrd 2286 | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑈) |
| 23 | 2, 7, 13, 22, 16 | strslfv2d 12919 | . 2 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑈)) |
| 24 | 1, 23 | eqtr4id 2258 | 1 ⊢ (𝜑 → 𝐴 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2177 Vcvv 2773 ⊆ wss 3167 {csn 3634 〈cop 3637 class class class wbr 4047 ◡ccnv 4678 Fun wfun 5270 ‘cfv 5276 ℕcn 9043 Struct cstr 12872 ndxcnx 12873 Slot cslot 12875 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-sbc 3000 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-nul 3462 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-iota 5237 df-fun 5278 df-fv 5284 df-struct 12878 df-slot 12880 |
| This theorem is referenced by: prdsbaslemss 13150 |
| Copyright terms: Public domain | W3C validator |