Theorem qsqeqor 10742

Description: The squares of two rational numbers are equal iff one number equals the other or its negative. (Contributed by Jim Kingdon, 1-Nov-2024.)

Assertion

Ref	Expression
qsqeqor	⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))

Proof of Theorem qsqeqor

Step	Hyp	Ref	Expression
1		qre 9699	. . . . . . 7 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ)
2	1	ad3antrrr 492	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → 𝐴 ∈ ℝ)
3		simplr 528	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → 0 ≤ 𝐴)
4		qre 9699	. . . . . . 7 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℝ)
5	4	ad3antlr 493	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → 𝐵 ∈ ℝ)
6		simpr 110	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → 0 ≤ 𝐵)
7		sq11 10704	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴↑2) = (𝐵↑2) ↔ 𝐴 = 𝐵))
8	2, 3, 5, 6, 7	syl22anc 1250	. . . . 5 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) ↔ 𝐴 = 𝐵))
9		orc 713	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))
10	8, 9	biimtrdi 163	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
11		oveq1 5929	. . . . . . 7 ⊢ (𝐴 = 𝐵 → (𝐴↑2) = (𝐵↑2))
12	11	a1i 9	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 = 𝐵 → (𝐴↑2) = (𝐵↑2)))
13		oveq1 5929	. . . . . . . . 9 ⊢ (𝐴 = -𝐵 → (𝐴↑2) = (-𝐵↑2))
14	13	adantl 277	. . . . . . . 8 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 = -𝐵) → (𝐴↑2) = (-𝐵↑2))
15		qcn 9708	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ)
16		sqneg 10690	. . . . . . . . . 10 ⊢ (𝐵 ∈ ℂ → (-𝐵↑2) = (𝐵↑2))
17	15, 16	syl 14	. . . . . . . . 9 ⊢ (𝐵 ∈ ℚ → (-𝐵↑2) = (𝐵↑2))
18	17	ad2antlr 489	. . . . . . . 8 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 = -𝐵) → (-𝐵↑2) = (𝐵↑2))
19	14, 18	eqtrd 2229	. . . . . . 7 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 = -𝐵) → (𝐴↑2) = (𝐵↑2))
20	19	ex 115	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 = -𝐵 → (𝐴↑2) = (𝐵↑2)))
21	12, 20	jaod 718	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((𝐴 = 𝐵 ∨ 𝐴 = -𝐵) → (𝐴↑2) = (𝐵↑2)))
22	21	ad2antrr 488	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → ((𝐴 = 𝐵 ∨ 𝐴 = -𝐵) → (𝐴↑2) = (𝐵↑2)))
23	10, 22	impbid 129	. . 3 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
24	17	eqeq2d 2208	. . . . . 6 ⊢ (𝐵 ∈ ℚ → ((𝐴↑2) = (-𝐵↑2) ↔ (𝐴↑2) = (𝐵↑2)))
25	24	ad3antlr 493	. . . . 5 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (-𝐵↑2) ↔ (𝐴↑2) = (𝐵↑2)))
26	1	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → 𝐴 ∈ ℝ)
27		simplr 528	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → 0 ≤ 𝐴)
28		qnegcl 9710	. . . . . . . . 9 ⊢ (𝐵 ∈ ℚ → -𝐵 ∈ ℚ)
29		qre 9699	. . . . . . . . 9 ⊢ (-𝐵 ∈ ℚ → -𝐵 ∈ ℝ)
30	28, 29	syl 14	. . . . . . . 8 ⊢ (𝐵 ∈ ℚ → -𝐵 ∈ ℝ)
31	30	ad3antlr 493	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → -𝐵 ∈ ℝ)
32		simpr 110	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → 𝐵 ≤ 0)
33	4	le0neg1d 8544	. . . . . . . . 9 ⊢ (𝐵 ∈ ℚ → (𝐵 ≤ 0 ↔ 0 ≤ -𝐵))
34	33	ad3antlr 493	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → (𝐵 ≤ 0 ↔ 0 ≤ -𝐵))
35	32, 34	mpbid 147	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → 0 ≤ -𝐵)
36		sq11 10704	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (-𝐵 ∈ ℝ ∧ 0 ≤ -𝐵)) → ((𝐴↑2) = (-𝐵↑2) ↔ 𝐴 = -𝐵))
37	26, 27, 31, 35, 36	syl22anc 1250	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (-𝐵↑2) ↔ 𝐴 = -𝐵))
38		olc 712	. . . . . 6 ⊢ (𝐴 = -𝐵 → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵))
39	37, 38	biimtrdi 163	. . . . 5 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (-𝐵↑2) → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
40	25, 39	sylbird 170	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (𝐵↑2) → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
41	21	ad2antrr 488	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → ((𝐴 = 𝐵 ∨ 𝐴 = -𝐵) → (𝐴↑2) = (𝐵↑2)))
42	40, 41	impbid 129	. . 3 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
43		0z 9337	. . . . . 6 ⊢ 0 ∈ ℤ
44		zq 9700	. . . . . 6 ⊢ (0 ∈ ℤ → 0 ∈ ℚ)
45	43, 44	ax-mp 5	. . . . 5 ⊢ 0 ∈ ℚ
46		qletric 10331	. . . . 5 ⊢ ((0 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (0 ≤ 𝐵 ∨ 𝐵 ≤ 0))
47	45, 46	mpan 424	. . . 4 ⊢ (𝐵 ∈ ℚ → (0 ≤ 𝐵 ∨ 𝐵 ≤ 0))
48	47	ad2antlr 489	. . 3 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) → (0 ≤ 𝐵 ∨ 𝐵 ≤ 0))
49	23, 42, 48	mpjaodan 799	. 2 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 0 ≤ 𝐴) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
50		qnegcl 9710	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℚ → -𝐴 ∈ ℚ)
51		qre 9699	. . . . . . . . . 10 ⊢ (-𝐴 ∈ ℚ → -𝐴 ∈ ℝ)
52	50, 51	syl 14	. . . . . . . . 9 ⊢ (𝐴 ∈ ℚ → -𝐴 ∈ ℝ)
53	52	ad3antrrr 492	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → -𝐴 ∈ ℝ)
54		simplr 528	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → 𝐴 ≤ 0)
55	1	le0neg1d 8544	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℚ → (𝐴 ≤ 0 ↔ 0 ≤ -𝐴))
56	55	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → (𝐴 ≤ 0 ↔ 0 ≤ -𝐴))
57	54, 56	mpbid 147	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → 0 ≤ -𝐴)
58	4	ad3antlr 493	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → 𝐵 ∈ ℝ)
59		simpr 110	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → 0 ≤ 𝐵)
60		sq11 10704	. . . . . . . 8 ⊢ (((-𝐴 ∈ ℝ ∧ 0 ≤ -𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((-𝐴↑2) = (𝐵↑2) ↔ -𝐴 = 𝐵))
61	53, 57, 58, 59, 60	syl22anc 1250	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((-𝐴↑2) = (𝐵↑2) ↔ -𝐴 = 𝐵))
62	61	biimpd 144	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((-𝐴↑2) = (𝐵↑2) → -𝐴 = 𝐵))
63		qcn 9708	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ)
64		sqneg 10690	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℂ → (-𝐴↑2) = (𝐴↑2))
65	63, 64	syl 14	. . . . . . . . 9 ⊢ (𝐴 ∈ ℚ → (-𝐴↑2) = (𝐴↑2))
66	65	adantr 276	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (-𝐴↑2) = (𝐴↑2))
67	66	eqeq1d 2205	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((-𝐴↑2) = (𝐵↑2) ↔ (𝐴↑2) = (𝐵↑2)))
68	67	ad2antrr 488	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((-𝐴↑2) = (𝐵↑2) ↔ (𝐴↑2) = (𝐵↑2)))
69		negcon1 8278	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-𝐴 = 𝐵 ↔ -𝐵 = 𝐴))
70	63, 15, 69	syl2an 289	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (-𝐴 = 𝐵 ↔ -𝐵 = 𝐴))
71		eqcom 2198	. . . . . . . 8 ⊢ (-𝐵 = 𝐴 ↔ 𝐴 = -𝐵)
72	70, 71	bitrdi 196	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (-𝐴 = 𝐵 ↔ 𝐴 = -𝐵))
73	72	ad2antrr 488	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → (-𝐴 = 𝐵 ↔ 𝐴 = -𝐵))
74	62, 68, 73	3imtr3d 202	. . . . 5 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) → 𝐴 = -𝐵))
75	74, 38	syl6 33	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
76	21	ad2antrr 488	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((𝐴 = 𝐵 ∨ 𝐴 = -𝐵) → (𝐴↑2) = (𝐵↑2)))
77	75, 76	impbid 129	. . 3 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
78	52	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → -𝐴 ∈ ℝ)
79		simplr 528	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → 𝐴 ≤ 0)
80	55	ad3antrrr 492	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → (𝐴 ≤ 0 ↔ 0 ≤ -𝐴))
81	79, 80	mpbid 147	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → 0 ≤ -𝐴)
82	30	ad3antlr 493	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → -𝐵 ∈ ℝ)
83		simpr 110	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → 𝐵 ≤ 0)
84	33	ad3antlr 493	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → (𝐵 ≤ 0 ↔ 0 ≤ -𝐵))
85	83, 84	mpbid 147	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → 0 ≤ -𝐵)
86		sq11 10704	. . . . . . 7 ⊢ (((-𝐴 ∈ ℝ ∧ 0 ≤ -𝐴) ∧ (-𝐵 ∈ ℝ ∧ 0 ≤ -𝐵)) → ((-𝐴↑2) = (-𝐵↑2) ↔ -𝐴 = -𝐵))
87	78, 81, 82, 85, 86	syl22anc 1250	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → ((-𝐴↑2) = (-𝐵↑2) ↔ -𝐴 = -𝐵))
88	65, 17	eqeqan12d 2212	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((-𝐴↑2) = (-𝐵↑2) ↔ (𝐴↑2) = (𝐵↑2)))
89	88	ad2antrr 488	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → ((-𝐴↑2) = (-𝐵↑2) ↔ (𝐴↑2) = (𝐵↑2)))
90	63	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → 𝐴 ∈ ℂ)
91	15	ad3antlr 493	. . . . . . 7 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → 𝐵 ∈ ℂ)
92	90, 91	neg11ad 8333	. . . . . 6 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → (-𝐴 = -𝐵 ↔ 𝐴 = 𝐵))
93	87, 89, 92	3bitr3d 218	. . . . 5 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (𝐵↑2) ↔ 𝐴 = 𝐵))
94	93, 9	biimtrdi 163	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (𝐵↑2) → (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
95	21	ad2antrr 488	. . . 4 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → ((𝐴 = 𝐵 ∨ 𝐴 = -𝐵) → (𝐴↑2) = (𝐵↑2)))
96	94, 95	impbid 129	. . 3 ⊢ ((((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) ∧ 𝐵 ≤ 0) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
97	47	ad2antlr 489	. . 3 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) → (0 ≤ 𝐵 ∨ 𝐵 ≤ 0))
98	77, 96, 97	mpjaodan 799	. 2 ⊢ (((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) ∧ 𝐴 ≤ 0) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))
99		qletric 10331	. . . 4 ⊢ ((0 ∈ ℚ ∧ 𝐴 ∈ ℚ) → (0 ≤ 𝐴 ∨ 𝐴 ≤ 0))
100	45, 99	mpan 424	. . 3 ⊢ (𝐴 ∈ ℚ → (0 ≤ 𝐴 ∨ 𝐴 ≤ 0))
101	100	adantr 276	. 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (0 ≤ 𝐴 ∨ 𝐴 ≤ 0))
102	49, 98, 101	mpjaodan 799	1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → ((𝐴↑2) = (𝐵↑2) ↔ (𝐴 = 𝐵 ∨ 𝐴 = -𝐵)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 709   = wceq 1364   ∈ wcel 2167   class class class wbr 4033  (class class class)co 5922  ℂcc 7877  ℝcr 7878  0cc0 7879   ≤ cle 8062  -cneg 8198  2c2 9041  ℤcz 9326  ℚcq 9693  ↑cexp 10630

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-2 9049  df-n0 9250  df-z 9327  df-uz 9602  df-q 9694  df-rp 9729  df-seqfrec 10540  df-exp 10631

This theorem is referenced by:  4sqlem10  12556