hashscontpow - Mathbox for metakunt

	Mathbox for metakunt		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > hashscontpow		Structured version Visualization version GIF version

Theorem hashscontpow 43172

Description: If a set contains all 𝑁-th powers, then the size of the image under the ZR homomorphism is greater than the 𝑅-th order of 𝑁. (Contributed by metakunt, 28-Apr-2025.)

**Hypotheses**
Ref	Expression
hashscontpow.1	⊢ (𝜑 → 𝐸 ⊆ ℤ)
hashscontpow.2	⊢ (𝜑 → 𝑁 ∈ ℕ)
hashscontpow.3	⊢ (𝜑 → ∀𝑘 ∈ ℕ₀ (𝑁↑𝑘) ∈ 𝐸)
hashscontpow.4	⊢ (𝜑 → 𝑅 ∈ ℕ)
hashscontpow.5	⊢ (𝜑 → (𝑁 gcd 𝑅) = 1)
hashscontpow.6	⊢ 𝐿 = (ℤRHom‘𝑌)
hashscontpow.7	⊢ 𝑌 = (ℤ/nℤ‘𝑅)

**Assertion**
Ref	Expression
hashscontpow	⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ≤ (♯‘(𝐿 “ 𝐸)))

Distinct variable groups: 𝑘,𝐸 𝑘,𝑁 Allowed substitution hints: 𝜑(𝑘) 𝑅(𝑘) 𝐿(𝑘) 𝑌(𝑘)

Proof of Theorem hashscontpow Dummy variables 𝑥 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		hashscontpow.4	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℕ)
2		hashscontpow.2	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ)
3	2	nnzd 12719	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
4		hashscontpow.5	. . . . 5 ⊢ (𝜑 → (𝑁 gcd 𝑅) = 1)
5		odzcl 16971	. . . . 5 ⊢ ((𝑅 ∈ ℕ ∧ 𝑁 ∈ ℤ ∧ (𝑁 gcd 𝑅) = 1) → ((od_ℤ‘𝑅)‘𝑁) ∈ ℕ)
6	1, 3, 4, 5	syl3anc 1398	. . . 4 ⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ∈ ℕ)
7	6	nnnn0d 12667	. . 3 ⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ∈ ℕ₀)
8		hashfz1 14490	. . 3 ⊢ (((od_ℤ‘𝑅)‘𝑁) ∈ ℕ₀ → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) = ((od_ℤ‘𝑅)‘𝑁))
9	7, 8	syl 18	. 2 ⊢ (𝜑 → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) = ((od_ℤ‘𝑅)‘𝑁))
10		ovexd 7455	. . . 4 ⊢ (𝜑 → (1...((od_ℤ‘𝑅)‘𝑁)) ∈ V)
11	10	mptexd 7230	. . 3 ⊢ (𝜑 → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))) ∈ V)
12		hashscontpow.6	. . . . . 6 ⊢ 𝐿 = (ℤRHom‘𝑌)
13	12	fvexi 6899	. . . . 5 ⊢ 𝐿 ∈ V
14	13	a1i 11	. . . 4 ⊢ (𝜑 → 𝐿 ∈ V)
15		imaexg 7925	. . . 4 ⊢ (𝐿 ∈ V → (𝐿 “ 𝐸) ∈ V)
16	14, 15	syl 18	. . 3 ⊢ (𝜑 → (𝐿 “ 𝐸) ∈ V)
17	1	nnnn0d 12667	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℕ₀)
18		hashscontpow.7	. . . . . . . . . . . 12 ⊢ 𝑌 = (ℤ/nℤ‘𝑅)
19	18	zncrng 21850	. . . . . . . . . . 11 ⊢ (𝑅 ∈ ℕ₀ → 𝑌 ∈ CRing)
20	17, 19	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ CRing)
21		crngring 20472	. . . . . . . . . 10 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
22	12	zrhrhm 21817	. . . . . . . . . 10 ⊢ (𝑌 ∈ Ring → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
23		zringbas 21759	. . . . . . . . . . 11 ⊢ ℤ = (Base‘ℤ_ring)
24		eqid 2761	. . . . . . . . . . 11 ⊢ (Base‘𝑌) = (Base‘𝑌)
25	23, 24	rhmf 20715	. . . . . . . . . 10 ⊢ (𝐿 ∈ (ℤ_ring RingHom 𝑌) → 𝐿:ℤ⟶(Base‘𝑌))
26	20, 21, 22, 25	4syl 20	. . . . . . . . 9 ⊢ (𝜑 → 𝐿:ℤ⟶(Base‘𝑌))
27	26	ffnd 6710	. . . . . . . 8 ⊢ (𝜑 → 𝐿 Fn ℤ)
28	27	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝐿 Fn ℤ)
29	3	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑁 ∈ ℤ)
30		elfznn 13687	. . . . . . . . . 10 ⊢ (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑥 ∈ ℕ)
31	30	adantl 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑥 ∈ ℕ)
32	31	nnnn0d 12667	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑥 ∈ ℕ₀)
33	29, 32	zexpcld 14230	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑁↑𝑥) ∈ ℤ)
34		oveq2 7428	. . . . . . . . 9 ⊢ (𝑘 = 𝑥 → (𝑁↑𝑘) = (𝑁↑𝑥))
35	34	eleq1d 2846	. . . . . . . 8 ⊢ (𝑘 = 𝑥 → ((𝑁↑𝑘) ∈ 𝐸 ↔ (𝑁↑𝑥) ∈ 𝐸))
36		hashscontpow.3	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ ℕ₀ (𝑁↑𝑘) ∈ 𝐸)
37	36	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ∀𝑘 ∈ ℕ₀ (𝑁↑𝑘) ∈ 𝐸)
38	35, 37, 32	rspcdva 3578	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑁↑𝑥) ∈ 𝐸)
39	28, 33, 38	fnfvimad 7240	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝐿‘(𝑁↑𝑥)) ∈ (𝐿 “ 𝐸))
40	39	fmpttd 7115	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))⟶(𝐿 “ 𝐸))
41	2	ad3antrrr 743	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑁 ∈ ℕ)
42		simpllr 788	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
43		simplr 781	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
44	1	ad3antrrr 743	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑅 ∈ ℕ)
45	4	ad3antrrr 743	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → (𝑁 gcd 𝑅) = 1)
46		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑎 < 𝑏)
47	41, 42, 43, 44, 45, 12, 18, 46	hashscontpow1 43171	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
48	2	ad3antrrr 743	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑁 ∈ ℕ)
49		simplr 781	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
50		simpllr 788	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
51	1	ad3antrrr 743	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑅 ∈ ℕ)
52	4	ad3antrrr 743	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → (𝑁 gcd 𝑅) = 1)
53		simpr 490	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑏 < 𝑎)
54	48, 49, 50, 51, 52, 12, 18, 53	hashscontpow1 43171	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑏)) ≠ (𝐿‘(𝑁↑𝑎)))
55	54	necomd 3011	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
56	47, 55	jaodan 972	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
57	56	ex 418	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ((𝑎 < 𝑏 ∨ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))))
58		biidd 265	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑎 = 𝑏 ↔ 𝑎 = 𝑏))
59	58	necon3bbid 2993	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 ↔ 𝑎 ≠ 𝑏))
60		elfzelz 13656	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑎 ∈ ℤ)
61	60	adantl 487	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑎 ∈ ℤ)
62	61	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑎 ∈ ℤ)
63	62	zred 12803	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑎 ∈ ℝ)
64		elfzelz 13656	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑏 ∈ ℤ)
65	64	zred 12803	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑏 ∈ ℝ)
66	65	adantl 487	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑏 ∈ ℝ)
67		lttri2 11392	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑎 ≠ 𝑏 ↔ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)))
68	63, 66, 67	syl2anc 596	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑎 ≠ 𝑏 ↔ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)))
69	59, 68	bitrd 282	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 ↔ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)))
70	69	imbi1d 344	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ((¬ 𝑎 = 𝑏 → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))) ↔ ((𝑎 < 𝑏 ∨ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))))
71	57, 70	mpbird 260	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))))
72	71	imp 412	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
73		eqidd 2762	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))) = (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))))
74		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑎) → 𝑥 = 𝑎)
75	74	oveq2d 7436	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑎) → (𝑁↑𝑥) = (𝑁↑𝑎))
76	75	fveq2d 6889	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑎) → (𝐿‘(𝑁↑𝑥)) = (𝐿‘(𝑁↑𝑎)))
77		simpllr 788	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
78		fvexd 6900	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝐿‘(𝑁↑𝑎)) ∈ V)
79	73, 76, 77, 78	fvmptd 7001	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = (𝐿‘(𝑁↑𝑎)))
80		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑏) → 𝑥 = 𝑏)
81	80	oveq2d 7436	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑏) → (𝑁↑𝑥) = (𝑁↑𝑏))
82	81	fveq2d 6889	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑏) → (𝐿‘(𝑁↑𝑥)) = (𝐿‘(𝑁↑𝑏)))
83		simplr 781	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
84		fvexd 6900	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝐿‘(𝑁↑𝑏)) ∈ V)
85	73, 82, 83, 84	fvmptd 7001	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) = (𝐿‘(𝑁↑𝑏)))
86	79, 85	neeq12d 3017	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) ≠ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) ↔ (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))))
87	72, 86	mpbird 260	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) ≠ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏))
88	87	neneqd 2961	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ¬ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏))
89	88	ex 418	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 → ¬ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏)))
90	89	con4d 116	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏))
91	90	ralrimiva 3155	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏))
92	91	ralrimiva 3155	. . . . 5 ⊢ (𝜑 → ∀𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏))
93	40, 92	jca 521	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))⟶(𝐿 “ 𝐸) ∧ ∀𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏)))
94		dff13 7258	. . . 4 ⊢ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))–1-1→(𝐿 “ 𝐸) ↔ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))⟶(𝐿 “ 𝐸) ∧ ∀𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏)))
95	93, 94	sylibr 237	. . 3 ⊢ (𝜑 → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))–1-1→(𝐿 “ 𝐸))
96		hashf1dmcdm 14589	. . 3 ⊢ (((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))) ∈ V ∧ (𝐿 “ 𝐸) ∈ V ∧ (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))–1-1→(𝐿 “ 𝐸)) → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) ≤ (♯‘(𝐿 “ 𝐸)))
97	11, 16, 95, 96	syl3anc 1398	. 2 ⊢ (𝜑 → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) ≤ (♯‘(𝐿 “ 𝐸)))
98	9, 97	eqbrtrrd 5129	1 ⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ≤ (♯‘(𝐿 “ 𝐸)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 Vcvv 3451 ⊆ wss 3899 class class class wbr 5103 ↦ cmpt 5186 “ cima 5654 Fn wfn 6533 ⟶wf 6534 –1-1→wf1 6535 ‘cfv 6538 (class class class)co 7420 ℝcr 11199 1c1 11201 < clt 11343 ≤ cle 11344 ℕcn 12335 ℕ₀cn0 12606 ℤcz 12693 ...cfz 13639 ↑cexp 14204 ♯chash 14474 gcd cgcd 16664 od_ℤcodz 16940 Basecbs 17387 Ringcrg 20459 CRingccrg 20460 RingHom crh 20699 ℤ_ringczring 21752 ℤRHomczrh 21805 ℤ/nℤczn 21808

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 ax-addf 11279 ax-mulf 11280

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-tpos 8243 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-oadd 8480 df-er 8717 df-ec 8719 df-qs 8723 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-inf 9435 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-xnn0 12680 df-z 12694 df-dec 12815 df-uz 12966 df-rp 13121 df-fz 13640 df-fzo 13789 df-fl 13932 df-mod 14010 df-seq 14145 df-exp 14205 df-hash 14475 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-dvds 16423 df-gcd 16665 df-prm 16847 df-odz 16942 df-phi 16943 df-struct 17325 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-starv 17443 df-sca 17444 df-vsca 17445 df-ip 17446 df-tset 17447 df-ple 17448 df-ds 17450 df-unif 17451 df-0g 17612 df-imas 17680 df-qus 17681 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-mhm 18978 df-grp 19147 df-minusg 19148 df-sbg 19149 df-mulg 19278 df-subg 19333 df-nsg 19334 df-eqg 19335 df-ghm 19428 df-cmn 19996 df-abl 19997 df-mgp 20361 df-rng 20375 df-ur 20408 df-ring 20461 df-cring 20462 df-oppr 20567 df-dvdsr 20587 df-rhm 20702 df-subrng 20798 df-subrg 20822 df-lmod 21137 df-lss 21207 df-lsp 21247 df-sra 21448 df-rgmod 21449 df-lidl 21486 df-rsp 21487 df-2idl 21543 df-cnfld 21679 df-zring 21753 df-zrh 21809 df-zn 21812

This theorem is used by: aks6d1c3 43173

W3C validator