Theorem strext 13206

Description: Extending the upper range of a structure. This works because when we say that a structure has components in 𝐴...𝐶 we are not saying that every slot in that range is present, just that all the slots that are present are within that range. (Contributed by Jim Kingdon, 26-Feb-2025.)

Hypotheses

Ref	Expression
strext.f	⊢ (𝜑 → 𝐹 Struct ⟨𝐴, 𝐵⟩)
strext.c	⊢ (𝜑 → 𝐶 ∈ (ℤ≥‘𝐵))

Assertion

Ref	Expression
strext	⊢ (𝜑 → 𝐹 Struct ⟨𝐴, 𝐶⟩)

Proof of Theorem strext

Step	Hyp	Ref	Expression
1		strext.f	. . . . 5 ⊢ (𝜑 → 𝐹 Struct ⟨𝐴, 𝐵⟩)
2		isstructim 13114	. . . . 5 ⊢ (𝐹 Struct ⟨𝐴, 𝐵⟩ → ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐴 ≤ 𝐵) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (𝐴...𝐵)))
3	1, 2	syl 14	. . . 4 ⊢ (𝜑 → ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐴 ≤ 𝐵) ∧ Fun (𝐹 ∖ {∅}) ∧ dom 𝐹 ⊆ (𝐴...𝐵)))
4	3	simp1d 1035	. . 3 ⊢ (𝜑 → (𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐴 ≤ 𝐵))
5	4	simp1d 1035	. 2 ⊢ (𝜑 → 𝐴 ∈ ℕ)
6	4	simp2d 1036	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℕ)
7		strext.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ (ℤ≥‘𝐵))
8		eluznn 9834	. . 3 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ (ℤ≥‘𝐵)) → 𝐶 ∈ ℕ)
9	6, 7, 8	syl2anc 411	. 2 ⊢ (𝜑 → 𝐶 ∈ ℕ)
10	5	nnred 9156	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ)
11	6	nnred 9156	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ)
12	9	nnred 9156	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ)
13	4	simp3d 1037	. . 3 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
14		eluzle 9768	. . . 4 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) → 𝐵 ≤ 𝐶)
15	7, 14	syl 14	. . 3 ⊢ (𝜑 → 𝐵 ≤ 𝐶)
16	10, 11, 12, 13, 15	letrd 8303	. 2 ⊢ (𝜑 → 𝐴 ≤ 𝐶)
17	3	simp2d 1036	. 2 ⊢ (𝜑 → Fun (𝐹 ∖ {∅}))
18		structex 13112	. . 3 ⊢ (𝐹 Struct ⟨𝐴, 𝐵⟩ → 𝐹 ∈ V)
19	1, 18	syl 14	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
20	3	simp3d 1037	. . 3 ⊢ (𝜑 → dom 𝐹 ⊆ (𝐴...𝐵))
21		fzss2 10299	. . . 4 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) → (𝐴...𝐵) ⊆ (𝐴...𝐶))
22	7, 21	syl 14	. . 3 ⊢ (𝜑 → (𝐴...𝐵) ⊆ (𝐴...𝐶))
23	20, 22	sstrd 3237	. 2 ⊢ (𝜑 → dom 𝐹 ⊆ (𝐴...𝐶))
24		isstructr 13115	. 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℕ ∧ 𝐴 ≤ 𝐶) ∧ (Fun (𝐹 ∖ {∅}) ∧ 𝐹 ∈ V ∧ dom 𝐹 ⊆ (𝐴...𝐶))) → 𝐹 Struct ⟨𝐴, 𝐶⟩)
25	5, 9, 16, 17, 19, 23, 24	syl33anc 1288	1 ⊢ (𝜑 → 𝐹 Struct ⟨𝐴, 𝐶⟩)

Syntax hints:   → wi 4   ∧ w3a 1004   ∈ wcel 2202  Vcvv 2802   ∖ cdif 3197   ⊆ wss 3200  ∅c0 3494  {csn 3669  ⟨cop 3672   class class class wbr 4088  dom cdm 4725  Fun wfun 5320  ‘cfv 5326  (class class class)co 6018   ≤ cle 8215  ℕcn 9143  ℤ_≥cuz 9755  ...cfz 10243   Struct cstr 13096

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-ltadd 8148

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-inn 9144  df-z 9480  df-uz 9756  df-fz 10244  df-struct 13102

This theorem is referenced by: (None)