Metamath Proof Explorer


Theorem setsstruct

Description: An extensible structure with a replaced slot is an extensible structure. (Contributed by AV, 9-Jun-2021) (Revised by AV, 14-Nov-2021)

Ref Expression
Assertion setsstruct ⊢ E ∈ V ∧ I ∈ ℤ ≥ M ∧ G Struct M N → G sSet I E Struct M if I ≤ N N I

Proof

Step Hyp Ref Expression
1 isstruct ⊢ G Struct M N ↔ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ Fun ⁡ G ∖ ∅ ∧ dom ⁡ G ⊆ M … N
2 simp2 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N
3 simp3l ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → E ∈ V
4 1z ⊢ 1 ∈ ℤ
5 nnge1 ⊢ M ∈ ℕ → 1 ≤ M
6 eluzuzle ⊢ 1 ∈ ℤ ∧ 1 ≤ M → I ∈ ℤ ≥ M → I ∈ ℤ ≥ 1
7 4 5 6 sylancr ⊢ M ∈ ℕ → I ∈ ℤ ≥ M → I ∈ ℤ ≥ 1
8 elnnuz ⊢ I ∈ ℕ ↔ I ∈ ℤ ≥ 1
9 7 8 imbitrrdi ⊢ M ∈ ℕ → I ∈ ℤ ≥ M → I ∈ ℕ
10 9 adantld ⊢ M ∈ ℕ → E ∈ V ∧ I ∈ ℤ ≥ M → I ∈ ℕ
11 10 3ad2ant1 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → E ∈ V ∧ I ∈ ℤ ≥ M → I ∈ ℕ
12 11 a1d ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → G Struct M N → E ∈ V ∧ I ∈ ℤ ≥ M → I ∈ ℕ
13 12 3imp ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → I ∈ ℕ
14 2 3 13 3jca ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ
15 op1stg ⊢ M ∈ ℕ ∧ N ∈ ℕ → 1 st ⁡ M N = M
16 15 breq2d ⊢ M ∈ ℕ ∧ N ∈ ℕ → I ≤ 1 st ⁡ M N ↔ I ≤ M
17 eqidd ⊢ M ∈ ℕ ∧ N ∈ ℕ → I = I
18 16 17 15 ifbieq12d ⊢ M ∈ ℕ ∧ N ∈ ℕ → if I ≤ 1 st ⁡ M N I 1 st ⁡ M N = if I ≤ M I M
19 18 3adant3 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → if I ≤ 1 st ⁡ M N I 1 st ⁡ M N = if I ≤ M I M
20 19 adantr ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → if I ≤ 1 st ⁡ M N I 1 st ⁡ M N = if I ≤ M I M
21 eluz2 ⊢ I ∈ ℤ ≥ M ↔ M ∈ ℤ ∧ I ∈ ℤ ∧ M ≤ I
22 zre ⊢ I ∈ ℤ → I ∈ ℝ
23 22 rexrd ⊢ I ∈ ℤ → I ∈ ℝ *
24 23 3ad2ant2 ⊢ M ∈ ℤ ∧ I ∈ ℤ ∧ M ≤ I → I ∈ ℝ *
25 zre ⊢ M ∈ ℤ → M ∈ ℝ
26 25 rexrd ⊢ M ∈ ℤ → M ∈ ℝ *
27 26 3ad2ant1 ⊢ M ∈ ℤ ∧ I ∈ ℤ ∧ M ≤ I → M ∈ ℝ *
28 simp3 ⊢ M ∈ ℤ ∧ I ∈ ℤ ∧ M ≤ I → M ≤ I
29 24 27 28 3jca ⊢ M ∈ ℤ ∧ I ∈ ℤ ∧ M ≤ I → I ∈ ℝ * ∧ M ∈ ℝ * ∧ M ≤ I
30 29 a1d ⊢ M ∈ ℤ ∧ I ∈ ℤ ∧ M ≤ I → M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → I ∈ ℝ * ∧ M ∈ ℝ * ∧ M ≤ I
31 21 30 sylbi ⊢ I ∈ ℤ ≥ M → M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → I ∈ ℝ * ∧ M ∈ ℝ * ∧ M ≤ I
32 31 adantl ⊢ E ∈ V ∧ I ∈ ℤ ≥ M → M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → I ∈ ℝ * ∧ M ∈ ℝ * ∧ M ≤ I
33 32 impcom ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → I ∈ ℝ * ∧ M ∈ ℝ * ∧ M ≤ I
34 xrmineq ⊢ I ∈ ℝ * ∧ M ∈ ℝ * ∧ M ≤ I → if I ≤ M I M = M
35 33 34 syl ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → if I ≤ M I M = M
36 20 35 eqtr2d ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → M = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N
37 36 3adant2 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → M = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N
38 op2ndg ⊢ M ∈ ℕ ∧ N ∈ ℕ → 2 nd ⁡ M N = N
39 38 eqcomd ⊢ M ∈ ℕ ∧ N ∈ ℕ → N = 2 nd ⁡ M N
40 39 breq2d ⊢ M ∈ ℕ ∧ N ∈ ℕ → I ≤ N ↔ I ≤ 2 nd ⁡ M N
41 40 39 17 ifbieq12d ⊢ M ∈ ℕ ∧ N ∈ ℕ → if I ≤ N N I = if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
42 41 3adant3 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → if I ≤ N N I = if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
43 42 3ad2ant1 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → if I ≤ N N I = if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
44 37 43 opeq12d ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
45 14 44 jca ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ G Struct M N ∧ E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
46 45 3exp ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N → G Struct M N → E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
47 46 3ad2ant1 ⊢ M ∈ ℕ ∧ N ∈ ℕ ∧ M ≤ N ∧ Fun ⁡ G ∖ ∅ ∧ dom ⁡ G ⊆ M … N → G Struct M N → E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
48 1 47 sylbi ⊢ G Struct M N → G Struct M N → E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
49 48 pm2.43i ⊢ G Struct M N → E ∈ V ∧ I ∈ ℤ ≥ M → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
50 49 expdcom ⊢ E ∈ V → I ∈ ℤ ≥ M → G Struct M N → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
51 50 3imp ⊢ E ∈ V ∧ I ∈ ℤ ≥ M ∧ G Struct M N → G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I
52 setsstruct2 ⊢ G Struct M N ∧ E ∈ V ∧ I ∈ ℕ ∧ M if I ≤ N N I = if I ≤ 1 st ⁡ M N I 1 st ⁡ M N if I ≤ 2 nd ⁡ M N 2 nd ⁡ M N I → G sSet I E Struct M if I ≤ N N I
53 51 52 syl ⊢ E ∈ V ∧ I ∈ ℤ ≥ M ∧ G Struct M N → G sSet I E Struct M if I ≤ N N I