Theorem halfnq 10929

Description: One-half of any positive fraction exists. Lemma for Proposition 9-2.6(i) of [Gleason] p. 120. (Contributed by NM, 16-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
halfnq	⊢ (𝐴 ∈ Q → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)

Distinct variable group:   𝑥,𝐴

Proof of Theorem halfnq

Step	Hyp	Ref	Expression
1		distrnq 10914	. . . 4 ⊢ (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q))))
2		distrnq 10914	. . . . . . . 8 ⊢ ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) +Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))))
3		1nq 10881	. . . . . . . . . . 11 ⊢ 1Q ∈ Q
4		addclnq 10898	. . . . . . . . . . 11 ⊢ ((1Q ∈ Q ∧ 1Q ∈ Q) → (1Q +Q 1Q) ∈ Q)
5	3, 3, 4	mp2an 692	. . . . . . . . . 10 ⊢ (1Q +Q 1Q) ∈ Q
6		recidnq 10918	. . . . . . . . . 10 ⊢ ((1Q +Q 1Q) ∈ Q → ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) = 1Q)
7	5, 6	ax-mp 5	. . . . . . . . 9 ⊢ ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) = 1Q
8	7, 7	oveq12i 7399	. . . . . . . 8 ⊢ (((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) +Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
9	2, 8	eqtri 2752	. . . . . . 7 ⊢ ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
10	9	oveq1i 7397	. . . . . 6 ⊢ (((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) ·Q (*Q‘(1Q +Q 1Q))) = ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))
11	7	oveq2i 7398	. . . . . . 7 ⊢ (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))) = (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q 1Q)
12		mulassnq 10912	. . . . . . . 8 ⊢ ((((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q (1Q +Q 1Q)) ·Q (*Q‘(1Q +Q 1Q))) = (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))))
13		mulcomnq 10906	. . . . . . . . 9 ⊢ (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q (1Q +Q 1Q)) = ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))))
14	13	oveq1i 7397	. . . . . . . 8 ⊢ ((((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q (1Q +Q 1Q)) ·Q (*Q‘(1Q +Q 1Q))) = (((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) ·Q (*Q‘(1Q +Q 1Q)))
15	12, 14	eqtr3i 2754	. . . . . . 7 ⊢ (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))) = (((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) ·Q (*Q‘(1Q +Q 1Q)))
16		recclnq 10919	. . . . . . . . 9 ⊢ ((1Q +Q 1Q) ∈ Q → (*Q‘(1Q +Q 1Q)) ∈ Q)
17		addclnq 10898	. . . . . . . . 9 ⊢ (((*Q‘(1Q +Q 1Q)) ∈ Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q) → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
18	16, 16, 17	syl2anc 584	. . . . . . . 8 ⊢ ((1Q +Q 1Q) ∈ Q → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
19		mulidnq 10916	. . . . . . . 8 ⊢ (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q → (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q 1Q) = ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))))
20	5, 18, 19	mp2b 10	. . . . . . 7 ⊢ (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q 1Q) = ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))
21	11, 15, 20	3eqtr3i 2760	. . . . . 6 ⊢ (((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) ·Q (*Q‘(1Q +Q 1Q))) = ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))
22	10, 21, 7	3eqtr3i 2760	. . . . 5 ⊢ ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) = 1Q
23	22	oveq2i 7398	. . . 4 ⊢ (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
24	1, 23	eqtr3i 2754	. . 3 ⊢ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
25		mulidnq 10916	. . 3 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴)
26	24, 25	eqtrid 2776	. 2 ⊢ (𝐴 ∈ Q → ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴)
27		ovex 7420	. . 3 ⊢ (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∈ V
28		oveq12 7396	. . . . 5 ⊢ ((𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∧ 𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
29	28	anidms 566	. . . 4 ⊢ (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
30	29	eqeq1d 2731	. . 3 ⊢ (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → ((𝑥 +Q 𝑥) = 𝐴 ↔ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴))
31	27, 30	spcev 3572	. 2 ⊢ (((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴 → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)
32	26, 31	syl 17	1 ⊢ (𝐴 ∈ Q → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)

Syntax hints:   → wi 4   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ‘cfv 6511  (class class class)co 7387  Qcnq 10805  1_Qc1q 10806   +_Q cplq 10808   ·_Q cmq 10809  *_Qcrq 10810

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-oadd 8438  df-omul 8439  df-er 8671  df-ni 10825  df-pli 10826  df-mi 10827  df-lti 10828  df-plpq 10861  df-mpq 10862  df-enq 10864  df-nq 10865  df-erq 10866  df-plq 10867  df-mq 10868  df-1nq 10869  df-rq 10870

This theorem is referenced by:  nsmallnq  10930