| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > imasvalstrd | GIF version | ||
| Description: An image structure value is a structure. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 30-Apr-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) |
| Ref | Expression |
|---|---|
| imasvalstr.u | ⊢ 𝑈 = (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) |
| imasvalstrd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| imasvalstrd.p | ⊢ (𝜑 → + ∈ 𝑊) |
| imasvalstrd.m | ⊢ (𝜑 → × ∈ 𝑋) |
| imasvalstrd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑌) |
| imasvalstrd.c | ⊢ (𝜑 → · ∈ 𝑍) |
| imasvalstrd.i | ⊢ (𝜑 → , ∈ 𝑃) |
| imasvalstrd.t | ⊢ (𝜑 → 𝑂 ∈ 𝑄) |
| imasvalstrd.l | ⊢ (𝜑 → 𝐿 ∈ 𝑅) |
| imasvalstrd.d | ⊢ (𝜑 → 𝐷 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| imasvalstrd | ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imasvalstr.u | . 2 ⊢ 𝑈 = (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) | |
| 2 | eqid 2206 | . . . 4 ⊢ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) | |
| 3 | imasvalstrd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 4 | imasvalstrd.p | . . . 4 ⊢ (𝜑 → + ∈ 𝑊) | |
| 5 | imasvalstrd.m | . . . 4 ⊢ (𝜑 → × ∈ 𝑋) | |
| 6 | imasvalstrd.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑌) | |
| 7 | imasvalstrd.c | . . . 4 ⊢ (𝜑 → · ∈ 𝑍) | |
| 8 | imasvalstrd.i | . . . 4 ⊢ (𝜑 → , ∈ 𝑃) | |
| 9 | 2, 3, 4, 5, 6, 7, 8 | ipsstrd 13083 | . . 3 ⊢ (𝜑 → ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) Struct 〈1, 8〉) |
| 10 | imasvalstrd.t | . . . 4 ⊢ (𝜑 → 𝑂 ∈ 𝑄) | |
| 11 | imasvalstrd.l | . . . 4 ⊢ (𝜑 → 𝐿 ∈ 𝑅) | |
| 12 | imasvalstrd.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐴) | |
| 13 | 9nn 9225 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 14 | tsetndx 13093 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
| 15 | 9lt10 9654 | . . . . 5 ⊢ 9 < ;10 | |
| 16 | 10nn 9539 | . . . . 5 ⊢ ;10 ∈ ℕ | |
| 17 | plendx 13107 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 18 | 1nn0 9331 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 19 | 0nn0 9330 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 20 | 2nn 9218 | . . . . . 6 ⊢ 2 ∈ ℕ | |
| 21 | 2pos 9147 | . . . . . 6 ⊢ 0 < 2 | |
| 22 | 18, 19, 20, 21 | declt 9551 | . . . . 5 ⊢ ;10 < ;12 |
| 23 | 18, 20 | decnncl 9543 | . . . . 5 ⊢ ;12 ∈ ℕ |
| 24 | dsndx 13122 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 25 | 13, 14, 15, 16, 17, 22, 23, 24 | strle3g 13015 | . . . 4 ⊢ ((𝑂 ∈ 𝑄 ∧ 𝐿 ∈ 𝑅 ∧ 𝐷 ∈ 𝐴) → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 26 | 10, 11, 12, 25 | syl3anc 1250 | . . 3 ⊢ (𝜑 → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 27 | 8lt9 9254 | . . . 4 ⊢ 8 < 9 | |
| 28 | 27 | a1i 9 | . . 3 ⊢ (𝜑 → 8 < 9) |
| 29 | 9, 26, 28 | strleund 13010 | . 2 ⊢ (𝜑 → (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) Struct 〈1, ;12〉) |
| 30 | 1, 29 | eqbrtrid 4086 | 1 ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2177 ∪ cun 3168 {ctp 3640 〈cop 3641 class class class wbr 4051 ‘cfv 5280 0cc0 7945 1c1 7946 < clt 8127 2c2 9107 8c8 9113 9c9 9114 ;cdc 9524 Struct cstr 12903 ndxcnx 12904 Basecbs 12907 +gcplusg 12984 .rcmulr 12985 Scalarcsca 12987 ·𝑠 cvsca 12988 ·𝑖cip 12989 TopSetcts 12990 lecple 12991 distcds 12993 |
| 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 4170 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-addcom 8045 ax-mulcom 8046 ax-addass 8047 ax-mulass 8048 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-1rid 8052 ax-0id 8053 ax-rnegex 8054 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-apti 8060 ax-pre-ltadd 8061 |
| This theorem depends on definitions: df-bi 117 df-3or 982 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-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-tp 3646 df-op 3647 df-uni 3857 df-int 3892 df-br 4052 df-opab 4114 df-mpt 4115 df-id 4348 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-inn 9057 df-2 9115 df-3 9116 df-4 9117 df-5 9118 df-6 9119 df-7 9120 df-8 9121 df-9 9122 df-n0 9316 df-z 9393 df-dec 9525 df-uz 9669 df-fz 10151 df-struct 12909 df-ndx 12910 df-slot 12911 df-base 12913 df-plusg 12997 df-mulr 12998 df-sca 13000 df-vsca 13001 df-ip 13002 df-tset 13003 df-ple 13004 df-ds 13006 |
| This theorem is referenced by: prdsvalstrd 13178 |
| Copyright terms: Public domain | W3C validator |