abvpropd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > abvpropd		Structured version Visualization version GIF version

Theorem abvpropd 20449

Description: If two structures have the same ring components, they have the same collection of absolute values. (Contributed by Mario Carneiro, 4-Oct-2015.)

**Hypotheses**
Ref	Expression
abvpropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
abvpropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
abvpropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+_g‘𝐾)𝑦) = (𝑥(+_g‘𝐿)𝑦))
abvpropd.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(._r‘𝐾)𝑦) = (𝑥(._r‘𝐿)𝑦))

**Assertion**
Ref	Expression
abvpropd	⊢ (𝜑 → (AbsVal‘𝐾) = (AbsVal‘𝐿))

Distinct variable groups: 𝑥,𝑦,𝐵 𝑥,𝐾,𝑦 𝑥,𝐿,𝑦 𝜑,𝑥,𝑦

Proof of Theorem abvpropd Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		abvpropd.1	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		abvpropd.2	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3		abvpropd.3	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+_g‘𝐾)𝑦) = (𝑥(+_g‘𝐿)𝑦))
4		abvpropd.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(._r‘𝐾)𝑦) = (𝑥(._r‘𝐿)𝑦))
5	1, 2, 3, 4	ringpropd 20101	. . . 4 ⊢ (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
6	1, 2	eqtr3d 2774	. . . . . 6 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
7	6	feq2d 6703	. . . . 5 ⊢ (𝜑 → (𝑓:(Base‘𝐾)⟶(0[,)+∞) ↔ 𝑓:(Base‘𝐿)⟶(0[,)+∞)))
8	1, 2, 3	grpidpropd 18580	. . . . . . . . . . 11 ⊢ (𝜑 → (0_g‘𝐾) = (0_g‘𝐿))
9	8	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (0_g‘𝐾) = (0_g‘𝐿))
10	9	eqeq2d 2743	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 = (0_g‘𝐾) ↔ 𝑥 = (0_g‘𝐿)))
11	10	bibi2d 342	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ↔ ((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿))))
12	4	fveqeq2d 6899	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ↔ (𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦))))
13	3	fveq2d 6895	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑓‘(𝑥(+_g‘𝐾)𝑦)) = (𝑓‘(𝑥(+_g‘𝐿)𝑦)))
14	13	breq1d 5158	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)) ↔ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))
15	12, 14	anbi12d 631	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
16	15	anassrs 468	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
17	16	ralbidva 3175	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
18	11, 17	anbi12d 631	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
19	18	ralbidva 3175	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ ∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
20	1	raleqdv 3325	. . . . . . . 8 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
21	20	anbi2d 629	. . . . . . 7 ⊢ (𝜑 → ((((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
22	1, 21	raleqbidv 3342	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐾)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
23	2	raleqdv 3325	. . . . . . . 8 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))) ↔ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))
24	23	anbi2d 629	. . . . . . 7 ⊢ (𝜑 → ((((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
25	2, 24	raleqbidv 3342	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ 𝐵 ((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐿)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
26	19, 22, 25	3bitr3d 308	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝐾)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))) ↔ ∀𝑥 ∈ (Base‘𝐿)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))
27	7, 26	anbi12d 631	. . . 4 ⊢ (𝜑 → ((𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))))
28	5, 27	anbi12d 631	. . 3 ⊢ (𝜑 → ((𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦))))))))
29		eqid 2732	. . . . 5 ⊢ (AbsVal‘𝐾) = (AbsVal‘𝐾)
30	29	abvrcl 20428	. . . 4 ⊢ (𝑓 ∈ (AbsVal‘𝐾) → 𝐾 ∈ Ring)
31		eqid 2732	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
32		eqid 2732	. . . . 5 ⊢ (+_g‘𝐾) = (+_g‘𝐾)
33		eqid 2732	. . . . 5 ⊢ (._r‘𝐾) = (._r‘𝐾)
34		eqid 2732	. . . . 5 ⊢ (0_g‘𝐾) = (0_g‘𝐾)
35	29, 31, 32, 33, 34	isabv 20426	. . . 4 ⊢ (𝐾 ∈ Ring → (𝑓 ∈ (AbsVal‘𝐾) ↔ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))))
36	30, 35	biadanii 820	. . 3 ⊢ (𝑓 ∈ (AbsVal‘𝐾) ↔ (𝐾 ∈ Ring ∧ (𝑓:(Base‘𝐾)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐾)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐾)) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑓‘(𝑥(._r‘𝐾)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐾)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))))
37		eqid 2732	. . . . 5 ⊢ (AbsVal‘𝐿) = (AbsVal‘𝐿)
38	37	abvrcl 20428	. . . 4 ⊢ (𝑓 ∈ (AbsVal‘𝐿) → 𝐿 ∈ Ring)
39		eqid 2732	. . . . 5 ⊢ (Base‘𝐿) = (Base‘𝐿)
40		eqid 2732	. . . . 5 ⊢ (+_g‘𝐿) = (+_g‘𝐿)
41		eqid 2732	. . . . 5 ⊢ (._r‘𝐿) = (._r‘𝐿)
42		eqid 2732	. . . . 5 ⊢ (0_g‘𝐿) = (0_g‘𝐿)
43	37, 39, 40, 41, 42	isabv 20426	. . . 4 ⊢ (𝐿 ∈ Ring → (𝑓 ∈ (AbsVal‘𝐿) ↔ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))))
44	38, 43	biadanii 820	. . 3 ⊢ (𝑓 ∈ (AbsVal‘𝐿) ↔ (𝐿 ∈ Ring ∧ (𝑓:(Base‘𝐿)⟶(0[,)+∞) ∧ ∀𝑥 ∈ (Base‘𝐿)(((𝑓‘𝑥) = 0 ↔ 𝑥 = (0_g‘𝐿)) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑓‘(𝑥(._r‘𝐿)𝑦)) = ((𝑓‘𝑥) · (𝑓‘𝑦)) ∧ (𝑓‘(𝑥(+_g‘𝐿)𝑦)) ≤ ((𝑓‘𝑥) + (𝑓‘𝑦)))))))
45	28, 36, 44	3bitr4g 313	. 2 ⊢ (𝜑 → (𝑓 ∈ (AbsVal‘𝐾) ↔ 𝑓 ∈ (AbsVal‘𝐿)))
46	45	eqrdv 2730	1 ⊢ (𝜑 → (AbsVal‘𝐾) = (AbsVal‘𝐿))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 class class class wbr 5148 ⟶wf 6539 ‘cfv 6543 (class class class)co 7408 0cc0 11109 + caddc 11112 · cmul 11114 +∞cpnf 11244 ≤ cle 11248 [,)cico 13325 Basecbs 17143 +_gcplusg 17196 ._rcmulr 17197 0_gc0g 17384 Ringcrg 20055 AbsValcabv 20423

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-2 12274 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17144 df-plusg 17209 df-0g 17386 df-mgm 18560 df-sgrp 18609 df-mnd 18625 df-grp 18821 df-mgp 19987 df-ring 20057 df-abv 20424

This theorem is referenced by: tngnrg 24190 abvpropd2 32124

W3C validator