| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > strslfv3 | GIF version | ||
| Description: Variant on strslfv 13278 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 13245 | . . . . 5 ⊢ (𝑆 Struct 𝑋 → 𝑆 ∈ V) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 7 | 3, 6 | eqeltrd 2311 | . . 3 ⊢ (𝜑 → 𝑈 ∈ V) |
| 8 | structfung 13250 | . . . . 5 ⊢ (𝑆 Struct 𝑋 → Fun ◡◡𝑆) | |
| 9 | 4, 8 | syl 14 | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) |
| 10 | 3 | cnveqd 4933 | . . . . . 6 ⊢ (𝜑 → ◡𝑈 = ◡𝑆) |
| 11 | 10 | cnveqd 4933 | . . . . 5 ⊢ (𝜑 → ◡◡𝑈 = ◡◡𝑆) |
| 12 | 11 | funeqd 5376 | . . . 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 4346 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ ℕ ∧ 𝐶 ∈ 𝑉) → 〈(𝐸‘ndx), 𝐶〉 ∈ V) | |
| 18 | 15, 16, 17 | sylancr 414 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ V) |
| 19 | snssg 3830 | . . . . . 6 ⊢ (〈(𝐸‘ndx), 𝐶〉 ∈ V → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 ↔ {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆)) | |
| 20 | 18, 19 | syl 14 | . . . . 5 ⊢ (𝜑 → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 ↔ {〈(𝐸‘ndx), 𝐶〉} ⊆ 𝑆)) |
| 21 | 14, 20 | mpbird 167 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
| 22 | 21, 3 | eleqtrrd 2314 | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑈) |
| 23 | 2, 7, 13, 22, 16 | strslfv2d 13276 | . 2 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑈)) |
| 24 | 1, 23 | eqtr4id 2286 | 1 ⊢ (𝜑 → 𝐴 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ⊆ wss 3213 {csn 3691 〈cop 3694 class class class wbr 4111 ◡ccnv 4750 Fun wfun 5348 ‘cfv 5354 ℕcn 9242 Struct cstr 13229 ndxcnx 13230 Slot cslot 13232 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3045 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-iota 5314 df-fun 5356 df-fv 5362 df-struct 13235 df-slot 13237 |
| This theorem is referenced by: prdsbaslemss 13508 |
| Copyright terms: Public domain | W3C validator |