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 42496

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 12526	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ)
4		hashscontpow.5	. . . . 5 ⊢ (𝜑 → (𝑁 gcd 𝑅) = 1)
5		odzcl 16733	. . . . 5 ⊢ ((𝑅 ∈ ℕ ∧ 𝑁 ∈ ℤ ∧ (𝑁 gcd 𝑅) = 1) → ((od_ℤ‘𝑅)‘𝑁) ∈ ℕ)
6	1, 3, 4, 5	syl3anc 1374	. . . 4 ⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ∈ ℕ)
7	6	nnnn0d 12474	. . 3 ⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ∈ ℕ₀)
8		hashfz1 14281	. . 3 ⊢ (((od_ℤ‘𝑅)‘𝑁) ∈ ℕ₀ → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) = ((od_ℤ‘𝑅)‘𝑁))
9	7, 8	syl 17	. 2 ⊢ (𝜑 → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) = ((od_ℤ‘𝑅)‘𝑁))
10		ovexd 7403	. . . 4 ⊢ (𝜑 → (1...((od_ℤ‘𝑅)‘𝑁)) ∈ V)
11	10	mptexd 7180	. . 3 ⊢ (𝜑 → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))) ∈ V)
12		hashscontpow.6	. . . . . 6 ⊢ 𝐿 = (ℤRHom‘𝑌)
13	12	fvexi 6856	. . . . 5 ⊢ 𝐿 ∈ V
14	13	a1i 11	. . . 4 ⊢ (𝜑 → 𝐿 ∈ V)
15		imaexg 7865	. . . 4 ⊢ (𝐿 ∈ V → (𝐿 “ 𝐸) ∈ V)
16	14, 15	syl 17	. . 3 ⊢ (𝜑 → (𝐿 “ 𝐸) ∈ V)
17	1	nnnn0d 12474	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℕ₀)
18		hashscontpow.7	. . . . . . . . . . . 12 ⊢ 𝑌 = (ℤ/nℤ‘𝑅)
19	18	zncrng 21514	. . . . . . . . . . 11 ⊢ (𝑅 ∈ ℕ₀ → 𝑌 ∈ CRing)
20	17, 19	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ CRing)
21		crngring 20195	. . . . . . . . . 10 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
22	12	zrhrhm 21481	. . . . . . . . . 10 ⊢ (𝑌 ∈ Ring → 𝐿 ∈ (ℤ_ring RingHom 𝑌))
23		zringbas 21423	. . . . . . . . . . 11 ⊢ ℤ = (Base‘ℤ_ring)
24		eqid 2737	. . . . . . . . . . 11 ⊢ (Base‘𝑌) = (Base‘𝑌)
25	23, 24	rhmf 20435	. . . . . . . . . 10 ⊢ (𝐿 ∈ (ℤ_ring RingHom 𝑌) → 𝐿:ℤ⟶(Base‘𝑌))
26	20, 21, 22, 25	4syl 19	. . . . . . . . 9 ⊢ (𝜑 → 𝐿:ℤ⟶(Base‘𝑌))
27	26	ffnd 6671	. . . . . . . 8 ⊢ (𝜑 → 𝐿 Fn ℤ)
28	27	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝐿 Fn ℤ)
29	3	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑁 ∈ ℤ)
30		elfznn 13481	. . . . . . . . . 10 ⊢ (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑥 ∈ ℕ)
31	30	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑥 ∈ ℕ)
32	31	nnnn0d 12474	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑥 ∈ ℕ₀)
33	29, 32	zexpcld 14022	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑁↑𝑥) ∈ ℤ)
34		oveq2 7376	. . . . . . . . 9 ⊢ (𝑘 = 𝑥 → (𝑁↑𝑘) = (𝑁↑𝑥))
35	34	eleq1d 2822	. . . . . . . 8 ⊢ (𝑘 = 𝑥 → ((𝑁↑𝑘) ∈ 𝐸 ↔ (𝑁↑𝑥) ∈ 𝐸))
36		hashscontpow.3	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ ℕ₀ (𝑁↑𝑘) ∈ 𝐸)
37	36	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ∀𝑘 ∈ ℕ₀ (𝑁↑𝑘) ∈ 𝐸)
38	35, 37, 32	rspcdva 3579	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑁↑𝑥) ∈ 𝐸)
39	28, 33, 38	fnfvimad 7190	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝐿‘(𝑁↑𝑥)) ∈ (𝐿 “ 𝐸))
40	39	fmpttd 7069	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))⟶(𝐿 “ 𝐸))
41	2	ad3antrrr 731	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑁 ∈ ℕ)
42		simpllr 776	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
43		simplr 769	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
44	1	ad3antrrr 731	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑅 ∈ ℕ)
45	4	ad3antrrr 731	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → (𝑁 gcd 𝑅) = 1)
46		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → 𝑎 < 𝑏)
47	41, 42, 43, 44, 45, 12, 18, 46	hashscontpow1 42495	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑎 < 𝑏) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
48	2	ad3antrrr 731	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑁 ∈ ℕ)
49		simplr 769	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
50		simpllr 776	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
51	1	ad3antrrr 731	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑅 ∈ ℕ)
52	4	ad3antrrr 731	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → (𝑁 gcd 𝑅) = 1)
53		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → 𝑏 < 𝑎)
54	48, 49, 50, 51, 52, 12, 18, 53	hashscontpow1 42495	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑏)) ≠ (𝐿‘(𝑁↑𝑎)))
55	54	necomd 2988	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
56	47, 55	jaodan 960	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
57	56	ex 412	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ((𝑎 < 𝑏 ∨ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))))
58		biidd 262	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑎 = 𝑏 ↔ 𝑎 = 𝑏))
59	58	necon3bbid 2970	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 ↔ 𝑎 ≠ 𝑏))
60		elfzelz 13452	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑎 ∈ ℤ)
61	60	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑎 ∈ ℤ)
62	61	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑎 ∈ ℤ)
63	62	zred 12608	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑎 ∈ ℝ)
64		elfzelz 13452	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑏 ∈ ℤ)
65	64	zred 12608	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) → 𝑏 ∈ ℝ)
66	65	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → 𝑏 ∈ ℝ)
67		lttri2 11227	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑎 ≠ 𝑏 ↔ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)))
68	63, 66, 67	syl2anc 585	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (𝑎 ≠ 𝑏 ↔ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)))
69	59, 68	bitrd 279	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 ↔ (𝑎 < 𝑏 ∨ 𝑏 < 𝑎)))
70	69	imbi1d 341	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ((¬ 𝑎 = 𝑏 → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))) ↔ ((𝑎 < 𝑏 ∨ 𝑏 < 𝑎) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))))
71	57, 70	mpbird 257	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))))
72	71	imp 406	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏)))
73		eqidd 2738	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))) = (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))))
74		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑎) → 𝑥 = 𝑎)
75	74	oveq2d 7384	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑎) → (𝑁↑𝑥) = (𝑁↑𝑎))
76	75	fveq2d 6846	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑎) → (𝐿‘(𝑁↑𝑥)) = (𝐿‘(𝑁↑𝑎)))
77		simpllr 776	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
78		fvexd 6857	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝐿‘(𝑁↑𝑎)) ∈ V)
79	73, 76, 77, 78	fvmptd 6957	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = (𝐿‘(𝑁↑𝑎)))
80		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑏) → 𝑥 = 𝑏)
81	80	oveq2d 7384	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑏) → (𝑁↑𝑥) = (𝑁↑𝑏))
82	81	fveq2d 6846	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) ∧ 𝑥 = 𝑏) → (𝐿‘(𝑁↑𝑥)) = (𝐿‘(𝑁↑𝑏)))
83		simplr 769	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁)))
84		fvexd 6857	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (𝐿‘(𝑁↑𝑏)) ∈ V)
85	73, 82, 83, 84	fvmptd 6957	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) = (𝐿‘(𝑁↑𝑏)))
86	79, 85	neeq12d 2994	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → (((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) ≠ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) ↔ (𝐿‘(𝑁↑𝑎)) ≠ (𝐿‘(𝑁↑𝑏))))
87	72, 86	mpbird 257	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) ≠ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏))
88	87	neneqd 2938	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ ¬ 𝑎 = 𝑏) → ¬ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏))
89	88	ex 412	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (¬ 𝑎 = 𝑏 → ¬ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏)))
90	89	con4d 115	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) ∧ 𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → (((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏))
91	90	ralrimiva 3130	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))) → ∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏))
92	91	ralrimiva 3130	. . . . 5 ⊢ (𝜑 → ∀𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏))
93	40, 92	jca 511	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))⟶(𝐿 “ 𝐸) ∧ ∀𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏)))
94		dff13 7210	. . . 4 ⊢ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))–1-1→(𝐿 “ 𝐸) ↔ ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))⟶(𝐿 “ 𝐸) ∧ ∀𝑎 ∈ (1...((od_ℤ‘𝑅)‘𝑁))∀𝑏 ∈ (1...((od_ℤ‘𝑅)‘𝑁))(((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑎) = ((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥)))‘𝑏) → 𝑎 = 𝑏)))
95	93, 94	sylibr 234	. . 3 ⊢ (𝜑 → (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))–1-1→(𝐿 “ 𝐸))
96		hashf1dmcdm 14379	. . 3 ⊢ (((𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))) ∈ V ∧ (𝐿 “ 𝐸) ∈ V ∧ (𝑥 ∈ (1...((od_ℤ‘𝑅)‘𝑁)) ↦ (𝐿‘(𝑁↑𝑥))):(1...((od_ℤ‘𝑅)‘𝑁))–1-1→(𝐿 “ 𝐸)) → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) ≤ (♯‘(𝐿 “ 𝐸)))
97	11, 16, 95, 96	syl3anc 1374	. 2 ⊢ (𝜑 → (♯‘(1...((od_ℤ‘𝑅)‘𝑁))) ≤ (♯‘(𝐿 “ 𝐸)))
98	9, 97	eqbrtrrd 5124	1 ⊢ (𝜑 → ((od_ℤ‘𝑅)‘𝑁) ≤ (♯‘(𝐿 “ 𝐸)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 Vcvv 3442 ⊆ wss 3903 class class class wbr 5100 ↦ cmpt 5181 “ cima 5635 Fn wfn 6495 ⟶wf 6496 –1-1→wf1 6497 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 1c1 11039 < clt 11178 ≤ cle 11179 ℕcn 12157 ℕ₀cn0 12413 ℤcz 12500 ...cfz 13435 ↑cexp 13996 ♯chash 14265 gcd cgcd 16433 od_ℤcodz 16702 Basecbs 17148 Ringcrg 20183 CRingccrg 20184 RingHom crh 20420 ℤ_ringczring 21416 ℤRHomczrh 21469 ℤ/nℤczn 21472

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 ax-mulf 11118

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-tpos 8178 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-oadd 8411 df-er 8645 df-ec 8647 df-qs 8651 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-inf 9358 df-dju 9825 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-xnn0 12487 df-z 12501 df-dec 12620 df-uz 12764 df-rp 12918 df-fz 13436 df-fzo 13583 df-fl 13724 df-mod 13802 df-seq 13937 df-exp 13997 df-hash 14266 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-dvds 16192 df-gcd 16434 df-prm 16611 df-odz 16704 df-phi 16705 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-mulr 17203 df-starv 17204 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-unif 17212 df-0g 17373 df-imas 17441 df-qus 17442 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-mhm 18720 df-grp 18881 df-minusg 18882 df-sbg 18883 df-mulg 19013 df-subg 19068 df-nsg 19069 df-eqg 19070 df-ghm 19157 df-cmn 19726 df-abl 19727 df-mgp 20091 df-rng 20103 df-ur 20132 df-ring 20185 df-cring 20186 df-oppr 20288 df-dvdsr 20308 df-rhm 20423 df-subrng 20494 df-subrg 20518 df-lmod 20828 df-lss 20898 df-lsp 20938 df-sra 21140 df-rgmod 21141 df-lidl 21178 df-rsp 21179 df-2idl 21220 df-cnfld 21325 df-zring 21417 df-zrh 21473 df-zn 21476

This theorem is referenced by: aks6d1c3 42497

W3C validator