smatrcl - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > smatrcl		Structured version Visualization version GIF version

Theorem smatrcl 34167

Description: Closure of the rectangular submatrix. (Contributed by Thierry Arnoux, 19-Aug-2020.)

**Hypotheses**
Ref	Expression
smat.s	⊢ 𝑆 = (𝐾(subMat1‘𝐴)𝐿)
smat.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
smat.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
smat.k	⊢ (𝜑 → 𝐾 ∈ (1...𝑀))
smat.l	⊢ (𝜑 → 𝐿 ∈ (1...𝑁))
smat.a	⊢ (𝜑 → 𝐴 ∈ (𝐵 ↑_m ((1...𝑀) × (1...𝑁))))

**Assertion**
Ref	Expression
smatrcl	⊢ (𝜑 → 𝑆 ∈ (𝐵 ↑_m ((1...(𝑀 − 1)) × (1...(𝑁 − 1)))))

Proof of Theorem smatrcl Dummy variables 𝑖 𝑗 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		smat.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ (𝐵 ↑_m ((1...𝑀) × (1...𝑁))))
2		elmapi 8847	. . . . . . . 8 ⊢ (𝐴 ∈ (𝐵 ↑_m ((1...𝑀) × (1...𝑁))) → 𝐴:((1...𝑀) × (1...𝑁))⟶𝐵)
3		ffun 6710	. . . . . . . 8 ⊢ (𝐴:((1...𝑀) × (1...𝑁))⟶𝐵 → Fun 𝐴)
4	1, 2, 3	3syl 19	. . . . . . 7 ⊢ (𝜑 → Fun 𝐴)
5		eqid 2763	. . . . . . . . 9 ⊢ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
6	5	mpofun 7536	. . . . . . . 8 ⊢ Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
7	6	a1i 11	. . . . . . 7 ⊢ (𝜑 → Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))
8		funco 6578	. . . . . . 7 ⊢ ((Fun 𝐴 ∧ Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) → Fun (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
9	4, 7, 8	syl2anc 595	. . . . . 6 ⊢ (𝜑 → Fun (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
10		smat.s	. . . . . . . 8 ⊢ 𝑆 = (𝐾(subMat1‘𝐴)𝐿)
11		fz1ssnn 13585	. . . . . . . . . 10 ⊢ (1...𝑀) ⊆ ℕ
12		smat.k	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ (1...𝑀))
13	11, 12	sselid 3936	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ ℕ)
14		fz1ssnn 13585	. . . . . . . . . 10 ⊢ (1...𝑁) ⊆ ℕ
15		smat.l	. . . . . . . . . 10 ⊢ (𝜑 → 𝐿 ∈ (1...𝑁))
16	14, 15	sselid 3936	. . . . . . . . 9 ⊢ (𝜑 → 𝐿 ∈ ℕ)
17		smatfval 34166	. . . . . . . . 9 ⊢ ((𝐾 ∈ ℕ ∧ 𝐿 ∈ ℕ ∧ 𝐴 ∈ (𝐵 ↑_m ((1...𝑀) × (1...𝑁)))) → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
18	13, 16, 1, 17	syl3anc 1398	. . . . . . . 8 ⊢ (𝜑 → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
19	10, 18	eqtrid 2810	. . . . . . 7 ⊢ (𝜑 → 𝑆 = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
20	19	funeqd 6560	. . . . . 6 ⊢ (𝜑 → (Fun 𝑆 ↔ Fun (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))))
21	9, 20	mpbird 260	. . . . 5 ⊢ (𝜑 → Fun 𝑆)
22		fdmrn 6739	. . . . 5 ⊢ (Fun 𝑆 ↔ 𝑆:dom 𝑆⟶ran 𝑆)
23	21, 22	sylib 221	. . . 4 ⊢ (𝜑 → 𝑆:dom 𝑆⟶ran 𝑆)
24	19	dmeqd 5897	. . . . . 6 ⊢ (𝜑 → dom 𝑆 = dom (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
25		dmco 6258	. . . . . . 7 ⊢ dom (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) = (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ dom 𝐴)
26		fdm 6717	. . . . . . . . . . . 12 ⊢ (𝐴:((1...𝑀) × (1...𝑁))⟶𝐵 → dom 𝐴 = ((1...𝑀) × (1...𝑁)))
27	1, 2, 26	3syl 19	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐴 = ((1...𝑀) × (1...𝑁)))
28	27	imaeq2d 6064	. . . . . . . . . 10 ⊢ (𝜑 → (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ dom 𝐴) = (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ ((1...𝑀) × (1...𝑁))))
29	28	eleq2d 2849	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ dom 𝐴) ↔ 𝑥 ∈ (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ ((1...𝑀) × (1...𝑁)))))
30		opex 5447	. . . . . . . . . . . 12 ⊢ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ ∈ V
31	5, 30	fnmpoi 8068	. . . . . . . . . . 11 ⊢ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) Fn (ℕ × ℕ)
32		elpreima 7055	. . . . . . . . . . 11 ⊢ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) Fn (ℕ × ℕ) → (𝑥 ∈ (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ ((1...𝑀) × (1...𝑁))) ↔ (𝑥 ∈ (ℕ × ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)))))
33	31, 32	ax-mp 5	. . . . . . . . . 10 ⊢ (𝑥 ∈ (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ ((1...𝑀) × (1...𝑁))) ↔ (𝑥 ∈ (ℕ × ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))))
34	33	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ ((1...𝑀) × (1...𝑁))) ↔ (𝑥 ∈ (ℕ × ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)))))
35		simplr 780	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩)
36	35	fveq2d 6887	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) = ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩))
37		df-ov 7415	. . . . . . . . . . . . . . . . . 18 ⊢ ((1^st ‘𝑥)(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)(2^nd ‘𝑥)) = ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩)
38	36, 37	eqtr4di 2816	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) = ((1^st ‘𝑥)(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)(2^nd ‘𝑥)))
39		breq1 5113	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 = (1^st ‘𝑥) → (𝑖 < 𝐾 ↔ (1^st ‘𝑥) < 𝐾))
40		id 23	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 = (1^st ‘𝑥) → 𝑖 = (1^st ‘𝑥))
41		oveq1 7419	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑖 = (1^st ‘𝑥) → (𝑖 + 1) = ((1^st ‘𝑥) + 1))
42	39, 40, 41	ifbieq12d 4517	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑖 = (1^st ‘𝑥) → if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)) = if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)))
43	42	opeq1d 4845	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑖 = (1^st ‘𝑥) → ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
44		breq1 5113	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 = (2^nd ‘𝑥) → (𝑗 < 𝐿 ↔ (2^nd ‘𝑥) < 𝐿))
45		id 23	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 = (2^nd ‘𝑥) → 𝑗 = (2^nd ‘𝑥))
46		oveq1 7419	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 = (2^nd ‘𝑥) → (𝑗 + 1) = ((2^nd ‘𝑥) + 1))
47	44, 45, 46	ifbieq12d 4517	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑗 = (2^nd ‘𝑥) → if(𝑗 < 𝐿, 𝑗, (𝑗 + 1)) = if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1)))
48	47	opeq2d 4846	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑗 = (2^nd ‘𝑥) → ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩)
49		opex 5447	. . . . . . . . . . . . . . . . . . 19 ⊢ ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩ ∈ V
50	43, 48, 5, 49	ovmpo 7572	. . . . . . . . . . . . . . . . . 18 ⊢ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) → ((1^st ‘𝑥)(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)(2^nd ‘𝑥)) = ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩)
51	50	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((1^st ‘𝑥)(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)(2^nd ‘𝑥)) = ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩)
52	38, 51	eqtrd 2798	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) = ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩)
53	52	eleq1d 2848	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)) ↔ ⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩ ∈ ((1...𝑀) × (1...𝑁))))
54		opelxp 5699	. . . . . . . . . . . . . . 15 ⊢ (⟨if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)), if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1))⟩ ∈ ((1...𝑀) × (1...𝑁)) ↔ (if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)) ∈ (1...𝑀) ∧ if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1)) ∈ (1...𝑁)))
55	53, 54	bitrdi 290	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)) ↔ (if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)) ∈ (1...𝑀) ∧ if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1)) ∈ (1...𝑁))))
56		ifel 4533	. . . . . . . . . . . . . . . 16 ⊢ (if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)) ∈ (1...𝑀) ↔ (((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ∈ (1...𝑀)) ∨ (¬ (1^st ‘𝑥) < 𝐾 ∧ ((1^st ‘𝑥) + 1) ∈ (1...𝑀))))
57		simplrl 788	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) ∈ ℕ)
58	57	nnred 12249	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) ∈ ℝ)
59	13	nnred 12249	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐾 ∈ ℝ)
60	59	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → 𝐾 ∈ ℝ)
61		smat.m	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → 𝑀 ∈ ℕ)
62	61	nnred 12249	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝑀 ∈ ℝ)
63	62	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → 𝑀 ∈ ℝ)
64		simpr 489	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) < 𝐾)
65	58, 60, 64	ltled 11359	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) ≤ 𝐾)
66		elfzle2 13557	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐾 ∈ (1...𝑀) → 𝐾 ≤ 𝑀)
67	12, 66	syl 18	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐾 ≤ 𝑀)
68	67	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → 𝐾 ≤ 𝑀)
69	58, 60, 63, 65, 68	letrd 11368	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) ≤ 𝑀)
70	57, 69	jca 520	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → ((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ 𝑀))
71	61	nnzd 12618	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 𝑀 ∈ ℤ)
72		fznn 13622	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑀 ∈ ℤ → ((1^st ‘𝑥) ∈ (1...𝑀) ↔ ((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ 𝑀)))
73	71, 72	syl 18	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → ((1^st ‘𝑥) ∈ (1...𝑀) ↔ ((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ 𝑀)))
74	73	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → ((1^st ‘𝑥) ∈ (1...𝑀) ↔ ((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ 𝑀)))
75	70, 74	mpbird 260	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) ∈ (1...𝑀))
76	58, 60, 63, 64, 68	ltletrd 11371	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) < 𝑀)
77	61	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → 𝑀 ∈ ℕ)
78		nnltlem1 12664	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((1^st ‘𝑥) ∈ ℕ ∧ 𝑀 ∈ ℕ) → ((1^st ‘𝑥) < 𝑀 ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
79	57, 77, 78	syl2anc 595	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → ((1^st ‘𝑥) < 𝑀 ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
80	76, 79	mpbid 235	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → (1^st ‘𝑥) ≤ (𝑀 − 1))
81	75, 80	2thd 268	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (1^st ‘𝑥) < 𝐾) → ((1^st ‘𝑥) ∈ (1...𝑀) ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
82	81	pm5.32da 589	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ∈ (1...𝑀)) ↔ ((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1))))
83		fznn 13622	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑀 ∈ ℤ → (((1^st ‘𝑥) + 1) ∈ (1...𝑀) ↔ (((1^st ‘𝑥) + 1) ∈ ℕ ∧ ((1^st ‘𝑥) + 1) ≤ 𝑀)))
84	71, 83	syl 18	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (((1^st ‘𝑥) + 1) ∈ (1...𝑀) ↔ (((1^st ‘𝑥) + 1) ∈ ℕ ∧ ((1^st ‘𝑥) + 1) ≤ 𝑀)))
85	84	ad2antrr 738	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((1^st ‘𝑥) + 1) ∈ (1...𝑀) ↔ (((1^st ‘𝑥) + 1) ∈ ℕ ∧ ((1^st ‘𝑥) + 1) ≤ 𝑀)))
86		simprl 782	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (1^st ‘𝑥) ∈ ℕ)
87	86	peano2nnd 12251	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((1^st ‘𝑥) + 1) ∈ ℕ)
88	87	biantrurd 541	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((1^st ‘𝑥) + 1) ≤ 𝑀 ↔ (((1^st ‘𝑥) + 1) ∈ ℕ ∧ ((1^st ‘𝑥) + 1) ≤ 𝑀)))
89	86	nnzd 12618	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (1^st ‘𝑥) ∈ ℤ)
90	71	ad2antrr 738	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → 𝑀 ∈ ℤ)
91		zltp1le 12645	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((1^st ‘𝑥) ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((1^st ‘𝑥) < 𝑀 ↔ ((1^st ‘𝑥) + 1) ≤ 𝑀))
92		zltlem1 12648	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((1^st ‘𝑥) ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((1^st ‘𝑥) < 𝑀 ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
93	91, 92	bitr3d 284	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1^st ‘𝑥) ∈ ℤ ∧ 𝑀 ∈ ℤ) → (((1^st ‘𝑥) + 1) ≤ 𝑀 ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
94	89, 90, 93	syl2anc 595	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((1^st ‘𝑥) + 1) ≤ 𝑀 ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
95	85, 88, 94	3bitr2d 310	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((1^st ‘𝑥) + 1) ∈ (1...𝑀) ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
96	95	anbi2d 641	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((¬ (1^st ‘𝑥) < 𝐾 ∧ ((1^st ‘𝑥) + 1) ∈ (1...𝑀)) ↔ (¬ (1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1))))
97	82, 96	orbi12d 931	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ∈ (1...𝑀)) ∨ (¬ (1^st ‘𝑥) < 𝐾 ∧ ((1^st ‘𝑥) + 1) ∈ (1...𝑀))) ↔ (((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)) ∨ (¬ (1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)))))
98		pm4.42 1069	. . . . . . . . . . . . . . . . . 18 ⊢ ((1^st ‘𝑥) ≤ (𝑀 − 1) ↔ (((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (1^st ‘𝑥) < 𝐾) ∨ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ ¬ (1^st ‘𝑥) < 𝐾)))
99		ancom 465	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (1^st ‘𝑥) < 𝐾) ↔ ((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)))
100		ancom 465	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ ¬ (1^st ‘𝑥) < 𝐾) ↔ (¬ (1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)))
101	99, 100	orbi12i 927	. . . . . . . . . . . . . . . . . 18 ⊢ ((((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (1^st ‘𝑥) < 𝐾) ∨ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ ¬ (1^st ‘𝑥) < 𝐾)) ↔ (((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)) ∨ (¬ (1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1))))
102	98, 101	bitri 278	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘𝑥) ≤ (𝑀 − 1) ↔ (((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)) ∨ (¬ (1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ≤ (𝑀 − 1))))
103	97, 102	bitr4di 292	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((((1^st ‘𝑥) < 𝐾 ∧ (1^st ‘𝑥) ∈ (1...𝑀)) ∨ (¬ (1^st ‘𝑥) < 𝐾 ∧ ((1^st ‘𝑥) + 1) ∈ (1...𝑀))) ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
104	56, 103	bitrid 286	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)) ∈ (1...𝑀) ↔ (1^st ‘𝑥) ≤ (𝑀 − 1)))
105		ifel 4533	. . . . . . . . . . . . . . . 16 ⊢ (if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1)) ∈ (1...𝑁) ↔ (((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ∈ (1...𝑁)) ∨ (¬ (2^nd ‘𝑥) < 𝐿 ∧ ((2^nd ‘𝑥) + 1) ∈ (1...𝑁))))
106		simplrr 789	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) ∈ ℕ)
107	106	nnred 12249	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) ∈ ℝ)
108	16	nnred 12249	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐿 ∈ ℝ)
109	108	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → 𝐿 ∈ ℝ)
110		smat.n	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → 𝑁 ∈ ℕ)
111	110	nnred 12249	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝑁 ∈ ℝ)
112	111	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → 𝑁 ∈ ℝ)
113		simpr 489	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) < 𝐿)
114	107, 109, 113	ltled 11359	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) ≤ 𝐿)
115		elfzle2 13557	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ (1...𝑁) → 𝐿 ≤ 𝑁)
116	15, 115	syl 18	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐿 ≤ 𝑁)
117	116	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → 𝐿 ≤ 𝑁)
118	107, 109, 112, 114, 117	letrd 11368	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) ≤ 𝑁)
119	106, 118	jca 520	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ 𝑁))
120	110	nnzd 12618	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 𝑁 ∈ ℤ)
121		fznn 13622	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑁 ∈ ℤ → ((2^nd ‘𝑥) ∈ (1...𝑁) ↔ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ 𝑁)))
122	120, 121	syl 18	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → ((2^nd ‘𝑥) ∈ (1...𝑁) ↔ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ 𝑁)))
123	122	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → ((2^nd ‘𝑥) ∈ (1...𝑁) ↔ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ 𝑁)))
124	119, 123	mpbird 260	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) ∈ (1...𝑁))
125	107, 109, 112, 113, 117	ltletrd 11371	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) < 𝑁)
126	110	ad3antrrr 742	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → 𝑁 ∈ ℕ)
127		nnltlem1 12664	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2^nd ‘𝑥) ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((2^nd ‘𝑥) < 𝑁 ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
128	106, 126, 127	syl2anc 595	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → ((2^nd ‘𝑥) < 𝑁 ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
129	125, 128	mpbid 235	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → (2^nd ‘𝑥) ≤ (𝑁 − 1))
130	124, 129	2thd 268	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ (2^nd ‘𝑥) < 𝐿) → ((2^nd ‘𝑥) ∈ (1...𝑁) ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
131	130	pm5.32da 589	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ∈ (1...𝑁)) ↔ ((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
132		fznn 13622	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℤ → (((2^nd ‘𝑥) + 1) ∈ (1...𝑁) ↔ (((2^nd ‘𝑥) + 1) ∈ ℕ ∧ ((2^nd ‘𝑥) + 1) ≤ 𝑁)))
133	120, 132	syl 18	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (((2^nd ‘𝑥) + 1) ∈ (1...𝑁) ↔ (((2^nd ‘𝑥) + 1) ∈ ℕ ∧ ((2^nd ‘𝑥) + 1) ≤ 𝑁)))
134	133	ad2antrr 738	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((2^nd ‘𝑥) + 1) ∈ (1...𝑁) ↔ (((2^nd ‘𝑥) + 1) ∈ ℕ ∧ ((2^nd ‘𝑥) + 1) ≤ 𝑁)))
135		simprr 784	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (2^nd ‘𝑥) ∈ ℕ)
136	135	peano2nnd 12251	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((2^nd ‘𝑥) + 1) ∈ ℕ)
137	136	biantrurd 541	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((2^nd ‘𝑥) + 1) ≤ 𝑁 ↔ (((2^nd ‘𝑥) + 1) ∈ ℕ ∧ ((2^nd ‘𝑥) + 1) ≤ 𝑁)))
138	135	nnzd 12618	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (2^nd ‘𝑥) ∈ ℤ)
139	120	ad2antrr 738	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → 𝑁 ∈ ℤ)
140		zltp1le 12645	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2^nd ‘𝑥) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((2^nd ‘𝑥) < 𝑁 ↔ ((2^nd ‘𝑥) + 1) ≤ 𝑁))
141		zltlem1 12648	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2^nd ‘𝑥) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((2^nd ‘𝑥) < 𝑁 ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
142	140, 141	bitr3d 284	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((2^nd ‘𝑥) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (((2^nd ‘𝑥) + 1) ≤ 𝑁 ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
143	138, 139, 142	syl2anc 595	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((2^nd ‘𝑥) + 1) ≤ 𝑁 ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
144	134, 137, 143	3bitr2d 310	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((2^nd ‘𝑥) + 1) ∈ (1...𝑁) ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
145	144	anbi2d 641	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((¬ (2^nd ‘𝑥) < 𝐿 ∧ ((2^nd ‘𝑥) + 1) ∈ (1...𝑁)) ↔ (¬ (2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
146	131, 145	orbi12d 931	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ∈ (1...𝑁)) ∨ (¬ (2^nd ‘𝑥) < 𝐿 ∧ ((2^nd ‘𝑥) + 1) ∈ (1...𝑁))) ↔ (((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)) ∨ (¬ (2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))))
147		pm4.42 1069	. . . . . . . . . . . . . . . . . 18 ⊢ ((2^nd ‘𝑥) ≤ (𝑁 − 1) ↔ (((2^nd ‘𝑥) ≤ (𝑁 − 1) ∧ (2^nd ‘𝑥) < 𝐿) ∨ ((2^nd ‘𝑥) ≤ (𝑁 − 1) ∧ ¬ (2^nd ‘𝑥) < 𝐿)))
148		ancom 465	. . . . . . . . . . . . . . . . . . 19 ⊢ (((2^nd ‘𝑥) ≤ (𝑁 − 1) ∧ (2^nd ‘𝑥) < 𝐿) ↔ ((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
149		ancom 465	. . . . . . . . . . . . . . . . . . 19 ⊢ (((2^nd ‘𝑥) ≤ (𝑁 − 1) ∧ ¬ (2^nd ‘𝑥) < 𝐿) ↔ (¬ (2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
150	148, 149	orbi12i 927	. . . . . . . . . . . . . . . . . 18 ⊢ ((((2^nd ‘𝑥) ≤ (𝑁 − 1) ∧ (2^nd ‘𝑥) < 𝐿) ∨ ((2^nd ‘𝑥) ≤ (𝑁 − 1) ∧ ¬ (2^nd ‘𝑥) < 𝐿)) ↔ (((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)) ∨ (¬ (2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
151	147, 150	bitri 278	. . . . . . . . . . . . . . . . 17 ⊢ ((2^nd ‘𝑥) ≤ (𝑁 − 1) ↔ (((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)) ∨ (¬ (2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
152	146, 151	bitr4di 292	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((((2^nd ‘𝑥) < 𝐿 ∧ (2^nd ‘𝑥) ∈ (1...𝑁)) ∨ (¬ (2^nd ‘𝑥) < 𝐿 ∧ ((2^nd ‘𝑥) + 1) ∈ (1...𝑁))) ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
153	105, 152	bitrid 286	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1)) ∈ (1...𝑁) ↔ (2^nd ‘𝑥) ≤ (𝑁 − 1)))
154	104, 153	anbi12d 643	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → ((if((1^st ‘𝑥) < 𝐾, (1^st ‘𝑥), ((1^st ‘𝑥) + 1)) ∈ (1...𝑀) ∧ if((2^nd ‘𝑥) < 𝐿, (2^nd ‘𝑥), ((2^nd ‘𝑥) + 1)) ∈ (1...𝑁)) ↔ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
155	55, 154	bitrd 282	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) → (((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)) ↔ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
156	155	pm5.32da 589	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) → ((((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))) ↔ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))))
157		1zzd 12626	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 1 ∈ ℤ)
158	71, 157	zsubcld 12706	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑀 − 1) ∈ ℤ)
159		fznn 13622	. . . . . . . . . . . . . . . 16 ⊢ ((𝑀 − 1) ∈ ℤ → ((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ↔ ((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ (𝑀 − 1))))
160	158, 159	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ↔ ((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ (𝑀 − 1))))
161	120, 157	zsubcld 12706	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
162		fznn 13622	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 − 1) ∈ ℤ → ((2^nd ‘𝑥) ∈ (1...(𝑁 − 1)) ↔ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
163	161, 162	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((2^nd ‘𝑥) ∈ (1...(𝑁 − 1)) ↔ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
164	160, 163	anbi12d 643	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ∧ (2^nd ‘𝑥) ∈ (1...(𝑁 − 1))) ↔ (((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)) ∧ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))))
165		an4 668	. . . . . . . . . . . . . 14 ⊢ ((((1^st ‘𝑥) ∈ ℕ ∧ (1^st ‘𝑥) ≤ (𝑀 − 1)) ∧ ((2^nd ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))) ↔ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1))))
166	164, 165	bitrdi 290	. . . . . . . . . . . . 13 ⊢ (𝜑 → (((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ∧ (2^nd ‘𝑥) ∈ (1...(𝑁 − 1))) ↔ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))))
167	166	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) → (((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ∧ (2^nd ‘𝑥) ∈ (1...(𝑁 − 1))) ↔ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((1^st ‘𝑥) ≤ (𝑀 − 1) ∧ (2^nd ‘𝑥) ≤ (𝑁 − 1)))))
168	156, 167	bitr4d 285	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩) → ((((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))) ↔ ((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ∧ (2^nd ‘𝑥) ∈ (1...(𝑁 − 1)))))
169	168	pm5.32da 589	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)))) ↔ (𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ ((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ∧ (2^nd ‘𝑥) ∈ (1...(𝑁 − 1))))))
170		elxp6 8021	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (ℕ × ℕ) ↔ (𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)))
171	170	anbi1i 635	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ (ℕ × ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))) ↔ ((𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))))
172		anass 473	. . . . . . . . . . 11 ⊢ (((𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ ((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ)) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))) ↔ (𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)))))
173	171, 172	bitri 278	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (ℕ × ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))) ↔ (𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ (((1^st ‘𝑥) ∈ ℕ ∧ (2^nd ‘𝑥) ∈ ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁)))))
174		elxp6 8021	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((1...(𝑀 − 1)) × (1...(𝑁 − 1))) ↔ (𝑥 = ⟨(1^st ‘𝑥), (2^nd ‘𝑥)⟩ ∧ ((1^st ‘𝑥) ∈ (1...(𝑀 − 1)) ∧ (2^nd ‘𝑥) ∈ (1...(𝑁 − 1)))))
175	169, 173, 174	3bitr4g 317	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ (ℕ × ℕ) ∧ ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘𝑥) ∈ ((1...𝑀) × (1...𝑁))) ↔ 𝑥 ∈ ((1...(𝑀 − 1)) × (1...(𝑁 − 1)))))
176	29, 34, 175	3bitrd 308	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ dom 𝐴) ↔ 𝑥 ∈ ((1...(𝑀 − 1)) × (1...(𝑁 − 1)))))
177	176	eqrdv 2761	. . . . . . 7 ⊢ (𝜑 → (^◡(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) “ dom 𝐴) = ((1...(𝑀 − 1)) × (1...(𝑁 − 1))))
178	25, 177	eqtrid 2810	. . . . . 6 ⊢ (𝜑 → dom (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) = ((1...(𝑀 − 1)) × (1...(𝑁 − 1))))
179	24, 178	eqtrd 2798	. . . . 5 ⊢ (𝜑 → dom 𝑆 = ((1...(𝑀 − 1)) × (1...(𝑁 − 1))))
180	179	feq2d 6691	. . . 4 ⊢ (𝜑 → (𝑆:dom 𝑆⟶ran 𝑆 ↔ 𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶ran 𝑆))
181	23, 180	mpbid 235	. . 3 ⊢ (𝜑 → 𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶ran 𝑆)
182	19	rneqd 5930	. . . . 5 ⊢ (𝜑 → ran 𝑆 = ran (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
183		rncoss 5969	. . . . 5 ⊢ ran (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) ⊆ ran 𝐴
184	182, 183	eqsstrdi 3982	. . . 4 ⊢ (𝜑 → ran 𝑆 ⊆ ran 𝐴)
185		frn 6715	. . . . 5 ⊢ (𝐴:((1...𝑀) × (1...𝑁))⟶𝐵 → ran 𝐴 ⊆ 𝐵)
186	1, 2, 185	3syl 19	. . . 4 ⊢ (𝜑 → ran 𝐴 ⊆ 𝐵)
187	184, 186	sstrd 3948	. . 3 ⊢ (𝜑 → ran 𝑆 ⊆ 𝐵)
188		fss 6724	. . 3 ⊢ ((𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶ran 𝑆 ∧ ran 𝑆 ⊆ 𝐵) → 𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶𝐵)
189	181, 187, 188	syl2anc 595	. 2 ⊢ (𝜑 → 𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶𝐵)
190		reldmmap 8833	. . . . . 6 ⊢ Rel dom ↑_m
191	190	ovrcl 7453	. . . . 5 ⊢ (𝐴 ∈ (𝐵 ↑_m ((1...𝑀) × (1...𝑁))) → (𝐵 ∈ V ∧ ((1...𝑀) × (1...𝑁)) ∈ V))
192	1, 191	syl 18	. . . 4 ⊢ (𝜑 → (𝐵 ∈ V ∧ ((1...𝑀) × (1...𝑁)) ∈ V))
193	192	simpld 499	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
194		ovex 7445	. . . 4 ⊢ (1...(𝑀 − 1)) ∈ V
195		ovex 7445	. . . 4 ⊢ (1...(𝑁 − 1)) ∈ V
196	194, 195	xpex 7753	. . 3 ⊢ ((1...(𝑀 − 1)) × (1...(𝑁 − 1))) ∈ V
197		elmapg 8837	. . 3 ⊢ ((𝐵 ∈ V ∧ ((1...(𝑀 − 1)) × (1...(𝑁 − 1))) ∈ V) → (𝑆 ∈ (𝐵 ↑_m ((1...(𝑀 − 1)) × (1...(𝑁 − 1)))) ↔ 𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶𝐵))
198	193, 196, 197	sylancl 597	. 2 ⊢ (𝜑 → (𝑆 ∈ (𝐵 ↑_m ((1...(𝑀 − 1)) × (1...(𝑁 − 1)))) ↔ 𝑆:((1...(𝑀 − 1)) × (1...(𝑁 − 1)))⟶𝐵))
199	189, 198	mpbird 260	1 ⊢ (𝜑 → 𝑆 ∈ (𝐵 ↑_m ((1...(𝑀 − 1)) × (1...(𝑁 − 1)))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ⊆ wss 3906 ifcif 4488 ⟨cop 4596 class class class wbr 5110 × cxp 5661 ^◡ccnv 5662 dom cdm 5663 ran crn 5664 “ cima 5666 ∘ ccom 5667 Fun wfun 6532 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 ∈ cmpo 7414 1^st c1st 7985 2^nd c2nd 7986 ↑_m cmap 8825 ℝcr 11100 1c1 11102 + caddc 11104 < clt 11244 ≤ cle 11245 − cmin 11442 ℕcn 12234 ℤcz 12592 ...cfz 13536 subMat1csmat 34164

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-map 8827 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-n0 12506 df-z 12593 df-uz 12864 df-fz 13537 df-smat 34165

This theorem is referenced by: smatcl 34173 1smat1 34175

W3C validator