Metamath Proof Explorer


Theorem 2strbas

Description: The base set of a constructed two-slot structure not depending on the hard-coded index value of the base set. (Contributed by AV, 22-Sep-2020)

Ref Expression
Hypotheses 2str.g ⊢ G = Base ndx B N + ˙
2str.b ⊢ Base ndx < N
2str.n ⊢ N ∈ ℕ
Assertion 2strbas ⊢ B ∈ V → B = Base G

Proof

Step Hyp Ref Expression
1 2str.g ⊢ G = Base ndx B N + ˙
2 2str.b ⊢ Base ndx < N
3 2str.n ⊢ N ∈ ℕ
4 1 2 3 2strstr ⊢ G Struct Base ndx N
5 baseid ⊢ Base = Slot Base ndx
6 snsspr1 ⊢ Base ndx B ⊆ Base ndx B N + ˙
7 6 1 sseqtrri ⊢ Base ndx B ⊆ G
8 4 5 7 strfv ⊢ B ∈ V → B = Base G