ztprmneprm - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ztprmneprm		Structured version Visualization version GIF version

Theorem ztprmneprm 43789

Description: A prime is not an integer multiple of another prime. (Contributed by AV, 23-May-2019.)

**Assertion**
Ref	Expression
ztprmneprm	⊢ ((𝑍 ∈ ℤ ∧ 𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))

**Proof of Theorem ztprmneprm**
Step	Hyp	Ref	Expression
1		elznn0nn 11806	. . 3 ⊢ (𝑍 ∈ ℤ ↔ (𝑍 ∈ ℕ₀ ∨ (𝑍 ∈ ℝ ∧ -𝑍 ∈ ℕ)))
2		elnn0 11708	. . . . 5 ⊢ (𝑍 ∈ ℕ₀ ↔ (𝑍 ∈ ℕ ∨ 𝑍 = 0))
3		elnn1uz2 12138	. . . . . . 7 ⊢ (𝑍 ∈ ℕ ↔ (𝑍 = 1 ∨ 𝑍 ∈ (ℤ_≥‘2)))
4		oveq1 6982	. . . . . . . . . . . 12 ⊢ (𝑍 = 1 → (𝑍 · 𝐴) = (1 · 𝐴))
5	4	adantr 473	. . . . . . . . . . 11 ⊢ ((𝑍 = 1 ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → (𝑍 · 𝐴) = (1 · 𝐴))
6	5	eqeq1d 2775	. . . . . . . . . 10 ⊢ ((𝑍 = 1 ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → ((𝑍 · 𝐴) = 𝐵 ↔ (1 · 𝐴) = 𝐵))
7		prmz 15874	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ ℙ → 𝐴 ∈ ℤ)
8	7	zcnd 11900	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ ℙ → 𝐴 ∈ ℂ)
9	8	mulid2d 10457	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℙ → (1 · 𝐴) = 𝐴)
10	9	adantr 473	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → (1 · 𝐴) = 𝐴)
11	10	eqeq1d 2775	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((1 · 𝐴) = 𝐵 ↔ 𝐴 = 𝐵))
12	11	biimpd 221	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((1 · 𝐴) = 𝐵 → 𝐴 = 𝐵))
13	12	adantl 474	. . . . . . . . . 10 ⊢ ((𝑍 = 1 ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → ((1 · 𝐴) = 𝐵 → 𝐴 = 𝐵))
14	6, 13	sylbid 232	. . . . . . . . 9 ⊢ ((𝑍 = 1 ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))
15	14	ex 405	. . . . . . . 8 ⊢ (𝑍 = 1 → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
16		prmuz2 15895	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℙ → 𝐴 ∈ (ℤ_≥‘2))
17	16	adantr 473	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → 𝐴 ∈ (ℤ_≥‘2))
18		nprm 15887	. . . . . . . . . . 11 ⊢ ((𝑍 ∈ (ℤ_≥‘2) ∧ 𝐴 ∈ (ℤ_≥‘2)) → ¬ (𝑍 · 𝐴) ∈ ℙ)
19	17, 18	sylan2 584	. . . . . . . . . 10 ⊢ ((𝑍 ∈ (ℤ_≥‘2) ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → ¬ (𝑍 · 𝐴) ∈ ℙ)
20		eleq1 2848	. . . . . . . . . . . . 13 ⊢ ((𝑍 · 𝐴) = 𝐵 → ((𝑍 · 𝐴) ∈ ℙ ↔ 𝐵 ∈ ℙ))
21	20	notbid 310	. . . . . . . . . . . 12 ⊢ ((𝑍 · 𝐴) = 𝐵 → (¬ (𝑍 · 𝐴) ∈ ℙ ↔ ¬ 𝐵 ∈ ℙ))
22		pm2.24 122	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ ℙ → (¬ 𝐵 ∈ ℙ → 𝐴 = 𝐵))
23	22	adantl 474	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → (¬ 𝐵 ∈ ℙ → 𝐴 = 𝐵))
24	23	adantl 474	. . . . . . . . . . . . 13 ⊢ ((𝑍 ∈ (ℤ_≥‘2) ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → (¬ 𝐵 ∈ ℙ → 𝐴 = 𝐵))
25	24	com12 32	. . . . . . . . . . . 12 ⊢ (¬ 𝐵 ∈ ℙ → ((𝑍 ∈ (ℤ_≥‘2) ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → 𝐴 = 𝐵))
26	21, 25	syl6bi 245	. . . . . . . . . . 11 ⊢ ((𝑍 · 𝐴) = 𝐵 → (¬ (𝑍 · 𝐴) ∈ ℙ → ((𝑍 ∈ (ℤ_≥‘2) ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → 𝐴 = 𝐵)))
27	26	com3l 89	. . . . . . . . . 10 ⊢ (¬ (𝑍 · 𝐴) ∈ ℙ → ((𝑍 ∈ (ℤ_≥‘2) ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
28	19, 27	mpcom 38	. . . . . . . . 9 ⊢ ((𝑍 ∈ (ℤ_≥‘2) ∧ (𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ)) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))
29	28	ex 405	. . . . . . . 8 ⊢ (𝑍 ∈ (ℤ_≥‘2) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
30	15, 29	jaoi 844	. . . . . . 7 ⊢ ((𝑍 = 1 ∨ 𝑍 ∈ (ℤ_≥‘2)) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
31	3, 30	sylbi 209	. . . . . 6 ⊢ (𝑍 ∈ ℕ → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
32		oveq1 6982	. . . . . . . . 9 ⊢ (𝑍 = 0 → (𝑍 · 𝐴) = (0 · 𝐴))
33	32	eqeq1d 2775	. . . . . . . 8 ⊢ (𝑍 = 0 → ((𝑍 · 𝐴) = 𝐵 ↔ (0 · 𝐴) = 𝐵))
34		prmnn 15873	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℙ → 𝐴 ∈ ℕ)
35	34	nnred 11455	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℙ → 𝐴 ∈ ℝ)
36		mul02lem2 10616	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℝ → (0 · 𝐴) = 0)
37	35, 36	syl 17	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℙ → (0 · 𝐴) = 0)
38	37	adantr 473	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → (0 · 𝐴) = 0)
39	38	eqeq1d 2775	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((0 · 𝐴) = 𝐵 ↔ 0 = 𝐵))
40		prmnn 15873	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℙ → 𝐵 ∈ ℕ)
41		elnnne0 11722	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℕ ↔ (𝐵 ∈ ℕ₀ ∧ 𝐵 ≠ 0))
42		eqneqall 2973	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = 0 → (𝐵 ≠ 0 → 𝐴 = 𝐵))
43	42	eqcoms 2781	. . . . . . . . . . . . . . 15 ⊢ (0 = 𝐵 → (𝐵 ≠ 0 → 𝐴 = 𝐵))
44	43	com12 32	. . . . . . . . . . . . . 14 ⊢ (𝐵 ≠ 0 → (0 = 𝐵 → 𝐴 = 𝐵))
45	44	adantl 474	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ ℕ₀ ∧ 𝐵 ≠ 0) → (0 = 𝐵 → 𝐴 = 𝐵))
46	41, 45	sylbi 209	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℕ → (0 = 𝐵 → 𝐴 = 𝐵))
47	40, 46	syl 17	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ℙ → (0 = 𝐵 → 𝐴 = 𝐵))
48	47	adantl 474	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → (0 = 𝐵 → 𝐴 = 𝐵))
49	39, 48	sylbid 232	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((0 · 𝐴) = 𝐵 → 𝐴 = 𝐵))
50	49	com12 32	. . . . . . . 8 ⊢ ((0 · 𝐴) = 𝐵 → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → 𝐴 = 𝐵))
51	33, 50	syl6bi 245	. . . . . . 7 ⊢ (𝑍 = 0 → ((𝑍 · 𝐴) = 𝐵 → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → 𝐴 = 𝐵)))
52	51	com23 86	. . . . . 6 ⊢ (𝑍 = 0 → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
53	31, 52	jaoi 844	. . . . 5 ⊢ ((𝑍 ∈ ℕ ∨ 𝑍 = 0) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
54	2, 53	sylbi 209	. . . 4 ⊢ (𝑍 ∈ ℕ₀ → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
55		elnnz 11802	. . . . . 6 ⊢ (-𝑍 ∈ ℕ ↔ (-𝑍 ∈ ℤ ∧ 0 < -𝑍))
56		lt0neg1 10946	. . . . . . . 8 ⊢ (𝑍 ∈ ℝ → (𝑍 < 0 ↔ 0 < -𝑍))
57	34	nngt0d 11488	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ ℙ → 0 < 𝐴)
58	57	adantr 473	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → 0 < 𝐴)
59		simpr 477	. . . . . . . . . . . . . 14 ⊢ ((𝑍 ∈ ℝ ∧ 𝑍 < 0) → 𝑍 < 0)
60	58, 59	anim12ci 605	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 ∈ ℝ ∧ 𝑍 < 0)) → (𝑍 < 0 ∧ 0 < 𝐴))
61	60	orcd 860	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 ∈ ℝ ∧ 𝑍 < 0)) → ((𝑍 < 0 ∧ 0 < 𝐴) ∨ (0 < 𝑍 ∧ 𝐴 < 0)))
62		simprl 759	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 ∈ ℝ ∧ 𝑍 < 0)) → 𝑍 ∈ ℝ)
63	35	adantr 473	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → 𝐴 ∈ ℝ)
64	63	adantr 473	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 ∈ ℝ ∧ 𝑍 < 0)) → 𝐴 ∈ ℝ)
65	62, 64	mul2lt0bi 12311	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 ∈ ℝ ∧ 𝑍 < 0)) → ((𝑍 · 𝐴) < 0 ↔ ((𝑍 < 0 ∧ 0 < 𝐴) ∨ (0 < 𝑍 ∧ 𝐴 < 0))))
66	61, 65	mpbird 249	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 ∈ ℝ ∧ 𝑍 < 0)) → (𝑍 · 𝐴) < 0)
67	66	ex 405	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 ∈ ℝ ∧ 𝑍 < 0) → (𝑍 · 𝐴) < 0))
68		breq1 4929	. . . . . . . . . . . . . 14 ⊢ ((𝑍 · 𝐴) = 𝐵 → ((𝑍 · 𝐴) < 0 ↔ 𝐵 < 0))
69	68	adantl 474	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 · 𝐴) = 𝐵) → ((𝑍 · 𝐴) < 0 ↔ 𝐵 < 0))
70		nnnn0 11714	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℕ₀)
71		nn0nlt0 11734	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℕ₀ → ¬ 𝐵 < 0)
72	71	pm2.21d 119	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℕ₀ → (𝐵 < 0 → 𝐴 = 𝐵))
73	70, 72	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ ℕ → (𝐵 < 0 → 𝐴 = 𝐵))
74	40, 73	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ ℙ → (𝐵 < 0 → 𝐴 = 𝐵))
75	74	adantl 474	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → (𝐵 < 0 → 𝐴 = 𝐵))
76	75	adantr 473	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 · 𝐴) = 𝐵) → (𝐵 < 0 → 𝐴 = 𝐵))
77	69, 76	sylbid 232	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) ∧ (𝑍 · 𝐴) = 𝐵) → ((𝑍 · 𝐴) < 0 → 𝐴 = 𝐵))
78	77	ex 405	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → ((𝑍 · 𝐴) < 0 → 𝐴 = 𝐵)))
79	78	com23 86	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) < 0 → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
80	67, 79	syldc 48	. . . . . . . . 9 ⊢ ((𝑍 ∈ ℝ ∧ 𝑍 < 0) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
81	80	ex 405	. . . . . . . 8 ⊢ (𝑍 ∈ ℝ → (𝑍 < 0 → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))))
82	56, 81	sylbird 252	. . . . . . 7 ⊢ (𝑍 ∈ ℝ → (0 < -𝑍 → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))))
83	82	adantld 483	. . . . . 6 ⊢ (𝑍 ∈ ℝ → ((-𝑍 ∈ ℤ ∧ 0 < -𝑍) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))))
84	55, 83	syl5bi 234	. . . . 5 ⊢ (𝑍 ∈ ℝ → (-𝑍 ∈ ℕ → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))))
85	84	imp 398	. . . 4 ⊢ ((𝑍 ∈ ℝ ∧ -𝑍 ∈ ℕ) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
86	54, 85	jaoi 844	. . 3 ⊢ ((𝑍 ∈ ℕ₀ ∨ (𝑍 ∈ ℝ ∧ -𝑍 ∈ ℕ)) → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
87	1, 86	sylbi 209	. 2 ⊢ (𝑍 ∈ ℤ → ((𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵)))
88	87	3impib 1097	1 ⊢ ((𝑍 ∈ ℤ ∧ 𝐴 ∈ ℙ ∧ 𝐵 ∈ ℙ) → ((𝑍 · 𝐴) = 𝐵 → 𝐴 = 𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 387 ∨ wo 834 ∧ w3a 1069 = wceq 1508 ∈ wcel 2051 ≠ wne 2962 class class class wbr 4926 ‘cfv 6186 (class class class)co 6975 ℝcr 10333 0cc0 10334 1c1 10335 · cmul 10339 < clt 10473 -cneg 10670 ℕcn 11438 2c2 11494 ℕ₀cn0 11706 ℤcz 11792 ℤ_≥cuz 12057 ℙcprime 15870

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1759 ax-4 1773 ax-5 1870 ax-6 1929 ax-7 1966 ax-8 2053 ax-9 2060 ax-10 2080 ax-11 2094 ax-12 2107 ax-13 2302 ax-ext 2745 ax-sep 5057 ax-nul 5064 ax-pow 5116 ax-pr 5183 ax-un 7278 ax-cnex 10390 ax-resscn 10391 ax-1cn 10392 ax-icn 10393 ax-addcl 10394 ax-addrcl 10395 ax-mulcl 10396 ax-mulrcl 10397 ax-mulcom 10398 ax-addass 10399 ax-mulass 10400 ax-distr 10401 ax-i2m1 10402 ax-1ne0 10403 ax-1rid 10404 ax-rnegex 10405 ax-rrecex 10406 ax-cnre 10407 ax-pre-lttri 10408 ax-pre-lttrn 10409 ax-pre-ltadd 10410 ax-pre-mulgt0 10411 ax-pre-sup 10412

This theorem depends on definitions: df-bi 199 df-an 388 df-or 835 df-3or 1070 df-3an 1071 df-tru 1511 df-ex 1744 df-nf 1748 df-sb 2017 df-mo 2548 df-eu 2585 df-clab 2754 df-cleq 2766 df-clel 2841 df-nfc 2913 df-ne 2963 df-nel 3069 df-ral 3088 df-rex 3089 df-reu 3090 df-rmo 3091 df-rab 3092 df-v 3412 df-sbc 3677 df-csb 3782 df-dif 3827 df-un 3829 df-in 3831 df-ss 3838 df-pss 3840 df-nul 4174 df-if 4346 df-pw 4419 df-sn 4437 df-pr 4439 df-tp 4441 df-op 4443 df-uni 4710 df-iun 4791 df-br 4927 df-opab 4989 df-mpt 5006 df-tr 5028 df-id 5309 df-eprel 5314 df-po 5323 df-so 5324 df-fr 5363 df-we 5365 df-xp 5410 df-rel 5411 df-cnv 5412 df-co 5413 df-dm 5414 df-rn 5415 df-res 5416 df-ima 5417 df-pred 5984 df-ord 6030 df-on 6031 df-lim 6032 df-suc 6033 df-iota 6150 df-fun 6188 df-fn 6189 df-f 6190 df-f1 6191 df-fo 6192 df-f1o 6193 df-fv 6194 df-riota 6936 df-ov 6978 df-oprab 6979 df-mpo 6980 df-om 7396 df-2nd 7501 df-wrecs 7749 df-recs 7811 df-rdg 7849 df-1o 7904 df-2o 7905 df-er 8088 df-en 8306 df-dom 8307 df-sdom 8308 df-fin 8309 df-sup 8700 df-pnf 10475 df-mnf 10476 df-xr 10477 df-ltxr 10478 df-le 10479 df-sub 10671 df-neg 10672 df-div 11098 df-nn 11439 df-2 11502 df-3 11503 df-n0 11707 df-z 11793 df-uz 12058 df-rp 12204 df-seq 13184 df-exp 13244 df-cj 14318 df-re 14319 df-im 14320 df-sqrt 14454 df-abs 14455 df-dvds 15467 df-prm 15871

This theorem is referenced by: zlmodzxznm 43949

W3C validator