crth - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > crth		GIF version

Theorem crth 12156

Description: The Chinese Remainder Theorem: the function that maps 𝑥 to its remainder classes mod 𝑀 and mod 𝑁 is 1-1 and onto when 𝑀 and 𝑁 are coprime. (Contributed by Mario Carneiro, 24-Feb-2014.) (Proof shortened by Mario Carneiro, 2-May-2016.)

**Hypotheses**
Ref	Expression
crth.1	⊢ 𝑆 = (0..^(𝑀 · 𝑁))
crth.2	⊢ 𝑇 = ((0..^𝑀) × (0..^𝑁))
crth.3	⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩)
crth.4	⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1))

**Assertion**
Ref	Expression
crth	⊢ (𝜑 → 𝐹:𝑆–1-1-onto→𝑇)

Distinct variable groups: 𝑥,𝑀 𝑥,𝑁 𝑥,𝑆 𝑥,𝑇 𝜑,𝑥 Allowed substitution hint: 𝐹(𝑥)

Proof of Theorem crth Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfzoelz 10082	. . . . . 6 ⊢ (𝑥 ∈ (0..^(𝑀 · 𝑁)) → 𝑥 ∈ ℤ)
2		crth.1	. . . . . 6 ⊢ 𝑆 = (0..^(𝑀 · 𝑁))
3	1, 2	eleq2s 2261	. . . . 5 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ ℤ)
4		simpr 109	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → 𝑥 ∈ ℤ)
5		crth.4	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1))
6	5	simp1d 999	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ)
7	6	adantr 274	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → 𝑀 ∈ ℕ)
8		zmodfzo 10282	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑀 ∈ ℕ) → (𝑥 mod 𝑀) ∈ (0..^𝑀))
9	4, 7, 8	syl2anc 409	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → (𝑥 mod 𝑀) ∈ (0..^𝑀))
10	5	simp2d 1000	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ)
11	10	adantr 274	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → 𝑁 ∈ ℕ)
12		zmodfzo 10282	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑥 mod 𝑁) ∈ (0..^𝑁))
13	4, 11, 12	syl2anc 409	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → (𝑥 mod 𝑁) ∈ (0..^𝑁))
14		opelxpi 4636	. . . . . . 7 ⊢ (((𝑥 mod 𝑀) ∈ (0..^𝑀) ∧ (𝑥 mod 𝑁) ∈ (0..^𝑁)) → ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩ ∈ ((0..^𝑀) × (0..^𝑁)))
15	9, 13, 14	syl2anc 409	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩ ∈ ((0..^𝑀) × (0..^𝑁)))
16		crth.2	. . . . . 6 ⊢ 𝑇 = ((0..^𝑀) × (0..^𝑁))
17	15, 16	eleqtrrdi 2260	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℤ) → ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩ ∈ 𝑇)
18	3, 17	sylan2 284	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩ ∈ 𝑇)
19		crth.3	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩)
20	18, 19	fmptd 5639	. . 3 ⊢ (𝜑 → 𝐹:𝑆⟶𝑇)
21		simprl 521	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑦 ∈ 𝑆)
22		elfzoelz 10082	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (0..^(𝑀 · 𝑁)) → 𝑦 ∈ ℤ)
23	22, 2	eleq2s 2261	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ℤ)
24	23	ad2antrl 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑦 ∈ ℤ)
25		zq 9564	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℚ)
26	24, 25	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑦 ∈ ℚ)
27	6	adantr 274	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑀 ∈ ℕ)
28		nnq 9571	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℚ)
29	27, 28	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑀 ∈ ℚ)
30	27	nngt0d 8901	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 0 < 𝑀)
31	26, 29, 30	modqcld 10263	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑦 mod 𝑀) ∈ ℚ)
32	10	adantr 274	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑁 ∈ ℕ)
33		nnq 9571	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℚ)
34	32, 33	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑁 ∈ ℚ)
35	32	nngt0d 8901	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 0 < 𝑁)
36	26, 34, 35	modqcld 10263	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑦 mod 𝑁) ∈ ℚ)
37		opexg 4206	. . . . . . . . 9 ⊢ (((𝑦 mod 𝑀) ∈ ℚ ∧ (𝑦 mod 𝑁) ∈ ℚ) → ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩ ∈ V)
38	31, 36, 37	syl2anc 409	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩ ∈ V)
39		oveq1 5849	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 mod 𝑀) = (𝑦 mod 𝑀))
40		oveq1 5849	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 mod 𝑁) = (𝑦 mod 𝑁))
41	39, 40	opeq12d 3766	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩ = ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩)
42	41, 19	fvmptg 5562	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝑆 ∧ ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩ ∈ V) → (𝐹‘𝑦) = ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩)
43	21, 38, 42	syl2anc 409	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝐹‘𝑦) = ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩)
44		simprr 522	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑧 ∈ 𝑆)
45		elfzoelz 10082	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ (0..^(𝑀 · 𝑁)) → 𝑧 ∈ ℤ)
46	45, 2	eleq2s 2261	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ℤ)
47	44, 46	syl 14	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑧 ∈ ℤ)
48		zq 9564	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℚ)
49	47, 48	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑧 ∈ ℚ)
50	49, 29, 30	modqcld 10263	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑧 mod 𝑀) ∈ ℚ)
51	49, 34, 35	modqcld 10263	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑧 mod 𝑁) ∈ ℚ)
52		opexg 4206	. . . . . . . . 9 ⊢ (((𝑧 mod 𝑀) ∈ ℚ ∧ (𝑧 mod 𝑁) ∈ ℚ) → ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩ ∈ V)
53	50, 51, 52	syl2anc 409	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩ ∈ V)
54		oveq1 5849	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 mod 𝑀) = (𝑧 mod 𝑀))
55		oveq1 5849	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 mod 𝑁) = (𝑧 mod 𝑁))
56	54, 55	opeq12d 3766	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ⟨(𝑥 mod 𝑀), (𝑥 mod 𝑁)⟩ = ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩)
57	56, 19	fvmptg 5562	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑆 ∧ ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩ ∈ V) → (𝐹‘𝑧) = ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩)
58	44, 53, 57	syl2anc 409	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝐹‘𝑧) = ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩)
59	43, 58	eqeq12d 2180	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ ⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩ = ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩))
60		opthg 4216	. . . . . . 7 ⊢ (((𝑦 mod 𝑀) ∈ ℚ ∧ (𝑦 mod 𝑁) ∈ ℚ) → (⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩ = ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩ ↔ ((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ∧ (𝑦 mod 𝑁) = (𝑧 mod 𝑁))))
61	31, 36, 60	syl2anc 409	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (⟨(𝑦 mod 𝑀), (𝑦 mod 𝑁)⟩ = ⟨(𝑧 mod 𝑀), (𝑧 mod 𝑁)⟩ ↔ ((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ∧ (𝑦 mod 𝑁) = (𝑧 mod 𝑁))))
62	59, 61	bitrd 187	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ ((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ∧ (𝑦 mod 𝑁) = (𝑧 mod 𝑁))))
63	27	nnzd 9312	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑀 ∈ ℤ)
64	32	nnzd 9312	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑁 ∈ ℤ)
65	21, 2	eleqtrdi 2259	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑦 ∈ (0..^(𝑀 · 𝑁)))
66	65, 22	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑦 ∈ ℤ)
67	44, 2	eleqtrdi 2259	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑧 ∈ (0..^(𝑀 · 𝑁)))
68	67, 45	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑧 ∈ ℤ)
69	66, 68	zsubcld 9318	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑦 − 𝑧) ∈ ℤ)
70	5	simp3d 1001	. . . . . . . 8 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 1)
71	70	adantr 274	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑀 gcd 𝑁) = 1)
72		coprmdvds2 12025	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑦 − 𝑧) ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝑀 ∥ (𝑦 − 𝑧) ∧ 𝑁 ∥ (𝑦 − 𝑧)) → (𝑀 · 𝑁) ∥ (𝑦 − 𝑧)))
73	63, 64, 69, 71, 72	syl31anc 1231	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑀 ∥ (𝑦 − 𝑧) ∧ 𝑁 ∥ (𝑦 − 𝑧)) → (𝑀 · 𝑁) ∥ (𝑦 − 𝑧)))
74		moddvds 11739	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ↔ 𝑀 ∥ (𝑦 − 𝑧)))
75	27, 66, 68, 74	syl3anc 1228	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ↔ 𝑀 ∥ (𝑦 − 𝑧)))
76		moddvds 11739	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑦 mod 𝑁) = (𝑧 mod 𝑁) ↔ 𝑁 ∥ (𝑦 − 𝑧)))
77	32, 66, 68, 76	syl3anc 1228	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑦 mod 𝑁) = (𝑧 mod 𝑁) ↔ 𝑁 ∥ (𝑦 − 𝑧)))
78	75, 77	anbi12d 465	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ∧ (𝑦 mod 𝑁) = (𝑧 mod 𝑁)) ↔ (𝑀 ∥ (𝑦 − 𝑧) ∧ 𝑁 ∥ (𝑦 − 𝑧))))
79		qmulcl 9575	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℚ ∧ 𝑁 ∈ ℚ) → (𝑀 · 𝑁) ∈ ℚ)
80	29, 34, 79	syl2anc 409	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑀 · 𝑁) ∈ ℚ)
81		elfzole1 10090	. . . . . . . . . 10 ⊢ (𝑦 ∈ (0..^(𝑀 · 𝑁)) → 0 ≤ 𝑦)
82	65, 81	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 0 ≤ 𝑦)
83		elfzolt2 10091	. . . . . . . . . 10 ⊢ (𝑦 ∈ (0..^(𝑀 · 𝑁)) → 𝑦 < (𝑀 · 𝑁))
84	65, 83	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑦 < (𝑀 · 𝑁))
85		modqid 10284	. . . . . . . . 9 ⊢ (((𝑦 ∈ ℚ ∧ (𝑀 · 𝑁) ∈ ℚ) ∧ (0 ≤ 𝑦 ∧ 𝑦 < (𝑀 · 𝑁))) → (𝑦 mod (𝑀 · 𝑁)) = 𝑦)
86	26, 80, 82, 84, 85	syl22anc 1229	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑦 mod (𝑀 · 𝑁)) = 𝑦)
87		elfzole1 10090	. . . . . . . . . 10 ⊢ (𝑧 ∈ (0..^(𝑀 · 𝑁)) → 0 ≤ 𝑧)
88	67, 87	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 0 ≤ 𝑧)
89		elfzolt2 10091	. . . . . . . . . 10 ⊢ (𝑧 ∈ (0..^(𝑀 · 𝑁)) → 𝑧 < (𝑀 · 𝑁))
90	67, 89	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → 𝑧 < (𝑀 · 𝑁))
91		modqid 10284	. . . . . . . . 9 ⊢ (((𝑧 ∈ ℚ ∧ (𝑀 · 𝑁) ∈ ℚ) ∧ (0 ≤ 𝑧 ∧ 𝑧 < (𝑀 · 𝑁))) → (𝑧 mod (𝑀 · 𝑁)) = 𝑧)
92	49, 80, 88, 90, 91	syl22anc 1229	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑧 mod (𝑀 · 𝑁)) = 𝑧)
93	86, 92	eqeq12d 2180	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑦 mod (𝑀 · 𝑁)) = (𝑧 mod (𝑀 · 𝑁)) ↔ 𝑦 = 𝑧))
94	27, 32	nnmulcld 8906	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑀 · 𝑁) ∈ ℕ)
95		moddvds 11739	. . . . . . . 8 ⊢ (((𝑀 · 𝑁) ∈ ℕ ∧ 𝑦 ∈ ℤ ∧ 𝑧 ∈ ℤ) → ((𝑦 mod (𝑀 · 𝑁)) = (𝑧 mod (𝑀 · 𝑁)) ↔ (𝑀 · 𝑁) ∥ (𝑦 − 𝑧)))
96	94, 66, 68, 95	syl3anc 1228	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑦 mod (𝑀 · 𝑁)) = (𝑧 mod (𝑀 · 𝑁)) ↔ (𝑀 · 𝑁) ∥ (𝑦 − 𝑧)))
97	93, 96	bitr3d 189	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑦 = 𝑧 ↔ (𝑀 · 𝑁) ∥ (𝑦 − 𝑧)))
98	73, 78, 97	3imtr4d 202	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (((𝑦 mod 𝑀) = (𝑧 mod 𝑀) ∧ (𝑦 mod 𝑁) = (𝑧 mod 𝑁)) → 𝑦 = 𝑧))
99	62, 98	sylbid 149	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
100	99	ralrimivva 2548	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
101		dff13 5736	. . 3 ⊢ (𝐹:𝑆–1-1→𝑇 ↔ (𝐹:𝑆⟶𝑇 ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧)))
102	20, 100, 101	sylanbrc 414	. 2 ⊢ (𝜑 → 𝐹:𝑆–1-1→𝑇)
103		nnnn0 9121	. . . . . 6 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
104		nnnn0 9121	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
105		hashfzo0 10736	. . . . . . . . 9 ⊢ (𝑀 ∈ ℕ₀ → (♯‘(0..^𝑀)) = 𝑀)
106		hashfzo0 10736	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → (♯‘(0..^𝑁)) = 𝑁)
107	105, 106	oveqan12d 5861	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((♯‘(0..^𝑀)) · (♯‘(0..^𝑁))) = (𝑀 · 𝑁))
108		0z 9202	. . . . . . . . . 10 ⊢ 0 ∈ ℤ
109		simpl 108	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 𝑀 ∈ ℕ₀)
110	109	nn0zd 9311	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 𝑀 ∈ ℤ)
111		fzofig 10367	. . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (0..^𝑀) ∈ Fin)
112	108, 110, 111	sylancr 411	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0..^𝑀) ∈ Fin)
113		nn0z 9211	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
114	113	adantl 275	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℤ)
115		fzofig 10367	. . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0..^𝑁) ∈ Fin)
116	108, 114, 115	sylancr 411	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0..^𝑁) ∈ Fin)
117		hashxp 10739	. . . . . . . . 9 ⊢ (((0..^𝑀) ∈ Fin ∧ (0..^𝑁) ∈ Fin) → (♯‘((0..^𝑀) × (0..^𝑁))) = ((♯‘(0..^𝑀)) · (♯‘(0..^𝑁))))
118	112, 116, 117	syl2anc 409	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (♯‘((0..^𝑀) × (0..^𝑁))) = ((♯‘(0..^𝑀)) · (♯‘(0..^𝑁))))
119		nn0mulcl 9150	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀 · 𝑁) ∈ ℕ₀)
120		hashfzo0 10736	. . . . . . . . 9 ⊢ ((𝑀 · 𝑁) ∈ ℕ₀ → (♯‘(0..^(𝑀 · 𝑁))) = (𝑀 · 𝑁))
121	119, 120	syl 14	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (♯‘(0..^(𝑀 · 𝑁))) = (𝑀 · 𝑁))
122	107, 118, 121	3eqtr4rd 2209	. . . . . . 7 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (♯‘(0..^(𝑀 · 𝑁))) = (♯‘((0..^𝑀) × (0..^𝑁))))
123	119	nn0zd 9311	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀 · 𝑁) ∈ ℤ)
124		fzofig 10367	. . . . . . . . 9 ⊢ ((0 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (0..^(𝑀 · 𝑁)) ∈ Fin)
125	108, 123, 124	sylancr 411	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0..^(𝑀 · 𝑁)) ∈ Fin)
126		xpfi 6895	. . . . . . . . 9 ⊢ (((0..^𝑀) ∈ Fin ∧ (0..^𝑁) ∈ Fin) → ((0..^𝑀) × (0..^𝑁)) ∈ Fin)
127	112, 116, 126	syl2anc 409	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((0..^𝑀) × (0..^𝑁)) ∈ Fin)
128		hashen 10697	. . . . . . . 8 ⊢ (((0..^(𝑀 · 𝑁)) ∈ Fin ∧ ((0..^𝑀) × (0..^𝑁)) ∈ Fin) → ((♯‘(0..^(𝑀 · 𝑁))) = (♯‘((0..^𝑀) × (0..^𝑁))) ↔ (0..^(𝑀 · 𝑁)) ≈ ((0..^𝑀) × (0..^𝑁))))
129	125, 127, 128	syl2anc 409	. . . . . . 7 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((♯‘(0..^(𝑀 · 𝑁))) = (♯‘((0..^𝑀) × (0..^𝑁))) ↔ (0..^(𝑀 · 𝑁)) ≈ ((0..^𝑀) × (0..^𝑁))))
130	122, 129	mpbid 146	. . . . . 6 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0..^(𝑀 · 𝑁)) ≈ ((0..^𝑀) × (0..^𝑁)))
131	103, 104, 130	syl2an 287	. . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (0..^(𝑀 · 𝑁)) ≈ ((0..^𝑀) × (0..^𝑁)))
132	6, 10, 131	syl2anc 409	. . . 4 ⊢ (𝜑 → (0..^(𝑀 · 𝑁)) ≈ ((0..^𝑀) × (0..^𝑁)))
133	132, 2, 16	3brtr4g 4016	. . 3 ⊢ (𝜑 → 𝑆 ≈ 𝑇)
134	6	nnnn0d 9167	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
135	10	nnnn0d 9167	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
136	134, 135, 127	syl2anc 409	. . . 4 ⊢ (𝜑 → ((0..^𝑀) × (0..^𝑁)) ∈ Fin)
137	16, 136	eqeltrid 2253	. . 3 ⊢ (𝜑 → 𝑇 ∈ Fin)
138		f1finf1o 6912	. . 3 ⊢ ((𝑆 ≈ 𝑇 ∧ 𝑇 ∈ Fin) → (𝐹:𝑆–1-1→𝑇 ↔ 𝐹:𝑆–1-1-onto→𝑇))
139	133, 137, 138	syl2anc 409	. 2 ⊢ (𝜑 → (𝐹:𝑆–1-1→𝑇 ↔ 𝐹:𝑆–1-1-onto→𝑇))
140	102, 139	mpbid 146	1 ⊢ (𝜑 → 𝐹:𝑆–1-1-onto→𝑇)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 ∀wral 2444 Vcvv 2726 ⟨cop 3579 class class class wbr 3982 ↦ cmpt 4043 × cxp 4602 ⟶wf 5184 –1-1→wf1 5185 –1-1-onto→wf1o 5187 ‘cfv 5188 (class class class)co 5842 ≈ cen 6704 Fincfn 6706 0cc0 7753 1c1 7754 · cmul 7758 < clt 7933 ≤ cle 7934 − cmin 8069 ℕcn 8857 ℕ₀cn0 9114 ℤcz 9191 ℚcq 9557 ..^cfzo 10077 mod cmo 10257 ♯chash 10688 ∥ cdvds 11727 gcd cgcd 11875

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-coll 4097 ax-sep 4100 ax-nul 4108 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-iinf 4565 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-precex 7863 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 ax-pre-mulgt0 7870 ax-pre-mulext 7871 ax-arch 7872 ax-caucvg 7873

This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-rab 2453 df-v 2728 df-sbc 2952 df-csb 3046 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-if 3521 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-iun 3868 df-br 3983 df-opab 4044 df-mpt 4045 df-tr 4081 df-id 4271 df-po 4274 df-iso 4275 df-iord 4344 df-on 4346 df-ilim 4347 df-suc 4349 df-iom 4568 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-f1 5193 df-fo 5194 df-f1o 5195 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-1st 6108 df-2nd 6109 df-recs 6273 df-irdg 6338 df-frec 6359 df-1o 6384 df-oadd 6388 df-er 6501 df-en 6707 df-dom 6708 df-fin 6709 df-sup 6949 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-reap 8473 df-ap 8480 df-div 8569 df-inn 8858 df-2 8916 df-3 8917 df-4 8918 df-n0 9115 df-z 9192 df-uz 9467 df-q 9558 df-rp 9590 df-fz 9945 df-fzo 10078 df-fl 10205 df-mod 10258 df-seqfrec 10381 df-exp 10455 df-ihash 10689 df-cj 10784 df-re 10785 df-im 10786 df-rsqrt 10940 df-abs 10941 df-dvds 11728 df-gcd 11876

This theorem is referenced by: phimullem 12157

W3C validator