Theorem halfnq 10967

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 10952	. . . 4 ⊢ (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q))))
2		distrnq 10952	. . . . . . . 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 10919	. . . . . . . . . . 11 ⊢ 1Q ∈ Q
4		addclnq 10936	. . . . . . . . . . 11 ⊢ ((1Q ∈ Q ∧ 1Q ∈ Q) → (1Q +Q 1Q) ∈ Q)
5	3, 3, 4	mp2an 690	. . . . . . . . . 10 ⊢ (1Q +Q 1Q) ∈ Q
6		recidnq 10956	. . . . . . . . . 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 7417	. . . . . . . 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 2760	. . . . . . 7 ⊢ ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
10	9	oveq1i 7415	. . . . . 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 7416	. . . . . . 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 10950	. . . . . . . 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 10944	. . . . . . . . 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 7415	. . . . . . . 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 2762	. . . . . . 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 10957	. . . . . . . . 9 ⊢ ((1Q +Q 1Q) ∈ Q → (*Q‘(1Q +Q 1Q)) ∈ Q)
17		addclnq 10936	. . . . . . . . 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 10954	. . . . . . . 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 2768	. . . . . 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 2768	. . . . 5 ⊢ ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) = 1Q
23	22	oveq2i 7416	. . . 4 ⊢ (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
24	1, 23	eqtr3i 2762	. . 3 ⊢ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
25		mulidnq 10954	. . 3 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴)
26	24, 25	eqtrid 2784	. 2 ⊢ (𝐴 ∈ Q → ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴)
27		ovex 7438	. . 3 ⊢ (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∈ V
28		oveq12 7414	. . . . 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 567	. . . 4 ⊢ (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
30	29	eqeq1d 2734	. . 3 ⊢ (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → ((𝑥 +Q 𝑥) = 𝐴 ↔ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴))
31	27, 30	spcev 3596	. 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 1541  ∃wex 1781   ∈ wcel 2106  ‘cfv 6540  (class class class)co 7405  Qcnq 10843  1_Qc1q 10844   +_Q cplq 10846   ·_Q cmq 10847  *_Qcrq 10848

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 5298  ax-nul 5305  ax-pr 5426  ax-un 7721

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-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-oadd 8466  df-omul 8467  df-er 8699  df-ni 10863  df-pli 10864  df-mi 10865  df-lti 10866  df-plpq 10899  df-mpq 10900  df-enq 10902  df-nq 10903  df-erq 10904  df-plq 10905  df-mq 10906  df-1nq 10907  df-rq 10908

This theorem is referenced by:  nsmallnq  10968