MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  setsstruct Structured version   Visualization version   GIF version

Theorem setsstruct 17218
Description: An extensible structure with a replaced slot is an extensible structure. (Contributed by AV, 9-Jun-2021.) (Revised by AV, 14-Nov-2021.)
Assertion
Ref Expression
setsstruct ((𝐸𝑉𝐼 ∈ (ℤ𝑀) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩) → (𝐺 sSet ⟨𝐼, 𝐸⟩) Struct ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩)

Proof of Theorem setsstruct
StepHypRef Expression
1 isstruct 17194 . . . . . 6 (𝐺 Struct ⟨𝑀, 𝑁⟩ ↔ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ Fun (𝐺 ∖ {∅}) ∧ dom 𝐺 ⊆ (𝑀...𝑁)))
2 simp2 1137 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → 𝐺 Struct ⟨𝑀, 𝑁⟩)
3 simp3l 1201 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → 𝐸𝑉)
4 1z 12669 . . . . . . . . . . . . . . . 16 1 ∈ ℤ
5 nnge1 12317 . . . . . . . . . . . . . . . 16 (𝑀 ∈ ℕ → 1 ≤ 𝑀)
6 eluzuzle 12908 . . . . . . . . . . . . . . . 16 ((1 ∈ ℤ ∧ 1 ≤ 𝑀) → (𝐼 ∈ (ℤ𝑀) → 𝐼 ∈ (ℤ‘1)))
74, 5, 6sylancr 586 . . . . . . . . . . . . . . 15 (𝑀 ∈ ℕ → (𝐼 ∈ (ℤ𝑀) → 𝐼 ∈ (ℤ‘1)))
8 elnnuz 12943 . . . . . . . . . . . . . . 15 (𝐼 ∈ ℕ ↔ 𝐼 ∈ (ℤ‘1))
97, 8imbitrrdi 252 . . . . . . . . . . . . . 14 (𝑀 ∈ ℕ → (𝐼 ∈ (ℤ𝑀) → 𝐼 ∈ ℕ))
109adantld 490 . . . . . . . . . . . . 13 (𝑀 ∈ ℕ → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → 𝐼 ∈ ℕ))
11103ad2ant1 1133 . . . . . . . . . . . 12 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → 𝐼 ∈ ℕ))
1211a1d 25 . . . . . . . . . . 11 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → 𝐼 ∈ ℕ)))
13123imp 1111 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → 𝐼 ∈ ℕ)
142, 3, 133jca 1128 . . . . . . . . 9 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → (𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ))
15 op1stg 8038 . . . . . . . . . . . . . . . 16 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (1st ‘⟨𝑀, 𝑁⟩) = 𝑀)
1615breq2d 5181 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩) ↔ 𝐼𝑀))
17 eqidd 2735 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝐼 = 𝐼)
1816, 17, 15ifbieq12d 4576 . . . . . . . . . . . . . 14 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)) = if(𝐼𝑀, 𝐼, 𝑀))
19183adant3 1132 . . . . . . . . . . . . 13 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)) = if(𝐼𝑀, 𝐼, 𝑀))
2019adantr 480 . . . . . . . . . . . 12 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)) = if(𝐼𝑀, 𝐼, 𝑀))
21 eluz2 12905 . . . . . . . . . . . . . . . 16 (𝐼 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀𝐼))
22 zre 12639 . . . . . . . . . . . . . . . . . . . 20 (𝐼 ∈ ℤ → 𝐼 ∈ ℝ)
2322rexrd 11336 . . . . . . . . . . . . . . . . . . 19 (𝐼 ∈ ℤ → 𝐼 ∈ ℝ*)
24233ad2ant2 1134 . . . . . . . . . . . . . . . . . 18 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀𝐼) → 𝐼 ∈ ℝ*)
25 zre 12639 . . . . . . . . . . . . . . . . . . . 20 (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
2625rexrd 11336 . . . . . . . . . . . . . . . . . . 19 (𝑀 ∈ ℤ → 𝑀 ∈ ℝ*)
27263ad2ant1 1133 . . . . . . . . . . . . . . . . . 18 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀𝐼) → 𝑀 ∈ ℝ*)
28 simp3 1138 . . . . . . . . . . . . . . . . . 18 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀𝐼) → 𝑀𝐼)
2924, 27, 283jca 1128 . . . . . . . . . . . . . . . . 17 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀𝐼) → (𝐼 ∈ ℝ*𝑀 ∈ ℝ*𝑀𝐼))
3029a1d 25 . . . . . . . . . . . . . . . 16 ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ ∧ 𝑀𝐼) → ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → (𝐼 ∈ ℝ*𝑀 ∈ ℝ*𝑀𝐼)))
3121, 30sylbi 217 . . . . . . . . . . . . . . 15 (𝐼 ∈ (ℤ𝑀) → ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → (𝐼 ∈ ℝ*𝑀 ∈ ℝ*𝑀𝐼)))
3231adantl 481 . . . . . . . . . . . . . 14 ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → (𝐼 ∈ ℝ*𝑀 ∈ ℝ*𝑀𝐼)))
3332impcom 407 . . . . . . . . . . . . 13 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → (𝐼 ∈ ℝ*𝑀 ∈ ℝ*𝑀𝐼))
34 xrmineq 13238 . . . . . . . . . . . . 13 ((𝐼 ∈ ℝ*𝑀 ∈ ℝ*𝑀𝐼) → if(𝐼𝑀, 𝐼, 𝑀) = 𝑀)
3533, 34syl 17 . . . . . . . . . . . 12 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → if(𝐼𝑀, 𝐼, 𝑀) = 𝑀)
3620, 35eqtr2d 2775 . . . . . . . . . . 11 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → 𝑀 = if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)))
37363adant2 1131 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → 𝑀 = if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)))
38 op2ndg 8039 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (2nd ‘⟨𝑀, 𝑁⟩) = 𝑁)
3938eqcomd 2740 . . . . . . . . . . . . . 14 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑁 = (2nd ‘⟨𝑀, 𝑁⟩))
4039breq2d 5181 . . . . . . . . . . . . 13 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝐼𝑁𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩)))
4140, 39, 17ifbieq12d 4576 . . . . . . . . . . . 12 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → if(𝐼𝑁, 𝑁, 𝐼) = if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼))
42413adant3 1132 . . . . . . . . . . 11 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → if(𝐼𝑁, 𝑁, 𝐼) = if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼))
43423ad2ant1 1133 . . . . . . . . . 10 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → if(𝐼𝑁, 𝑁, 𝐼) = if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼))
4437, 43opeq12d 4905 . . . . . . . . 9 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩)
4514, 44jca 511 . . . . . . . 8 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ (𝐸𝑉𝐼 ∈ (ℤ𝑀))) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))
46453exp 1119 . . . . . . 7 ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
47463ad2ant1 1133 . . . . . 6 (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀𝑁) ∧ Fun (𝐺 ∖ {∅}) ∧ dom 𝐺 ⊆ (𝑀...𝑁)) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
481, 47sylbi 217 . . . . 5 (𝐺 Struct ⟨𝑀, 𝑁⟩ → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
4948pm2.43i 52 . . . 4 (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐸𝑉𝐼 ∈ (ℤ𝑀)) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩)))
5049expdcom 414 . . 3 (𝐸𝑉 → (𝐼 ∈ (ℤ𝑀) → (𝐺 Struct ⟨𝑀, 𝑁⟩ → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))))
51503imp 1111 . 2 ((𝐸𝑉𝐼 ∈ (ℤ𝑀) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩) → ((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩))
52 setsstruct2 17216 . 2 (((𝐺 Struct ⟨𝑀, 𝑁⟩ ∧ 𝐸𝑉𝐼 ∈ ℕ) ∧ ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩ = ⟨if(𝐼 ≤ (1st ‘⟨𝑀, 𝑁⟩), 𝐼, (1st ‘⟨𝑀, 𝑁⟩)), if(𝐼 ≤ (2nd ‘⟨𝑀, 𝑁⟩), (2nd ‘⟨𝑀, 𝑁⟩), 𝐼)⟩) → (𝐺 sSet ⟨𝐼, 𝐸⟩) Struct ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩)
5351, 52syl 17 1 ((𝐸𝑉𝐼 ∈ (ℤ𝑀) ∧ 𝐺 Struct ⟨𝑀, 𝑁⟩) → (𝐺 sSet ⟨𝐼, 𝐸⟩) Struct ⟨𝑀, if(𝐼𝑁, 𝑁, 𝐼)⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1537  wcel 2103  cdif 3967  wss 3970  c0 4347  ifcif 4548  {csn 4648  cop 4654   class class class wbr 5169  dom cdm 5699  Fun wfun 6566  cfv 6572  (class class class)co 7445  1st c1st 8024  2nd c2nd 8025  1c1 11181  *cxr 11319  cle 11321  cn 12289  cz 12635  cuz 12899  ...cfz 13563   Struct cstr 17188   sSet csts 17205
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2105  ax-9 2113  ax-10 2136  ax-11 2153  ax-12 2173  ax-ext 2705  ax-sep 5320  ax-nul 5327  ax-pow 5386  ax-pr 5450  ax-un 7766  ax-cnex 11236  ax-resscn 11237  ax-1cn 11238  ax-icn 11239  ax-addcl 11240  ax-addrcl 11241  ax-mulcl 11242  ax-mulrcl 11243  ax-mulcom 11244  ax-addass 11245  ax-mulass 11246  ax-distr 11247  ax-i2m1 11248  ax-1ne0 11249  ax-1rid 11250  ax-rnegex 11251  ax-rrecex 11252  ax-cnre 11253  ax-pre-lttri 11254  ax-pre-lttrn 11255  ax-pre-ltadd 11256  ax-pre-mulgt0 11257
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2890  df-ne 2943  df-nel 3049  df-ral 3064  df-rex 3073  df-reu 3384  df-rab 3439  df-v 3484  df-sbc 3799  df-csb 3916  df-dif 3973  df-un 3975  df-in 3977  df-ss 3987  df-pss 3990  df-nul 4348  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5021  df-br 5170  df-opab 5232  df-mpt 5253  df-tr 5287  df-id 5597  df-eprel 5603  df-po 5611  df-so 5612  df-fr 5654  df-we 5656  df-xp 5705  df-rel 5706  df-cnv 5707  df-co 5708  df-dm 5709  df-rn 5710  df-res 5711  df-ima 5712  df-pred 6331  df-ord 6397  df-on 6398  df-lim 6399  df-suc 6400  df-iota 6524  df-fun 6574  df-fn 6575  df-f 6576  df-f1 6577  df-fo 6578  df-f1o 6579  df-fv 6580  df-riota 7401  df-ov 7448  df-oprab 7449  df-mpo 7450  df-om 7900  df-1st 8026  df-2nd 8027  df-frecs 8318  df-wrecs 8349  df-recs 8423  df-rdg 8462  df-1o 8518  df-er 8759  df-en 9000  df-dom 9001  df-sdom 9002  df-fin 9003  df-pnf 11322  df-mnf 11323  df-xr 11324  df-ltxr 11325  df-le 11326  df-sub 11518  df-neg 11519  df-nn 12290  df-n0 12550  df-z 12636  df-uz 12900  df-fz 13564  df-struct 17189  df-sets 17206
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator