Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2strstr1 | Structured version Visualization version GIF version |
Description: A constructed two-slot structure. Version of 2strstr 15809 not depending on the hard-coded index value of the base set. (Contributed by AV, 22-Sep-2020.) |
Ref | Expression |
---|---|
2str1.g | ⊢ 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈𝑁, + 〉} |
2str1.b | ⊢ (Base‘ndx) < 𝑁 |
2str1.n | ⊢ 𝑁 ∈ ℕ |
Ref | Expression |
---|---|
2strstr1 | ⊢ 𝐺 Struct 〈(Base‘ndx), 𝑁〉 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2str1.g | . . . 4 ⊢ 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈𝑁, + 〉} | |
2 | eqid 2610 | . . . . . . . 8 ⊢ Slot 𝑁 = Slot 𝑁 | |
3 | 2str1.n | . . . . . . . 8 ⊢ 𝑁 ∈ ℕ | |
4 | 2, 3 | ndxarg 15715 | . . . . . . 7 ⊢ (Slot 𝑁‘ndx) = 𝑁 |
5 | 4 | eqcomi 2619 | . . . . . 6 ⊢ 𝑁 = (Slot 𝑁‘ndx) |
6 | 5 | opeq1i 4343 | . . . . 5 ⊢ 〈𝑁, + 〉 = 〈(Slot 𝑁‘ndx), + 〉 |
7 | 6 | preq2i 4216 | . . . 4 ⊢ {〈(Base‘ndx), 𝐵〉, 〈𝑁, + 〉} = {〈(Base‘ndx), 𝐵〉, 〈(Slot 𝑁‘ndx), + 〉} |
8 | 1, 7 | eqtri 2632 | . . 3 ⊢ 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈(Slot 𝑁‘ndx), + 〉} |
9 | basendx 15751 | . . . 4 ⊢ (Base‘ndx) = 1 | |
10 | 2str1.b | . . . 4 ⊢ (Base‘ndx) < 𝑁 | |
11 | 9, 10 | eqbrtrri 4606 | . . 3 ⊢ 1 < 𝑁 |
12 | 8, 2, 11, 3 | 2strstr 15809 | . 2 ⊢ 𝐺 Struct 〈1, 𝑁〉 |
13 | 9 | opeq1i 4343 | . 2 ⊢ 〈(Base‘ndx), 𝑁〉 = 〈1, 𝑁〉 |
14 | 12, 13 | breqtrri 4610 | 1 ⊢ 𝐺 Struct 〈(Base‘ndx), 𝑁〉 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 ∈ wcel 1977 {cpr 4127 〈cop 4131 class class class wbr 4583 ‘cfv 5804 1c1 9816 < clt 9953 ℕcn 10897 Struct cstr 15691 ndxcnx 15692 Slot cslot 15694 Basecbs 15695 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 |
This theorem is referenced by: 2strbas1 15813 2strop1 15814 struct2grstr 25703 |
Copyright terms: Public domain | W3C validator |