Theorem halfnq 11088

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 11073	. . . 4 ⊢ (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q))))
2		distrnq 11073	. . . . . . . 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 11040	. . . . . . . . . . 11 ⊢ 1Q ∈ Q
4		addclnq 11057	. . . . . . . . . . 11 ⊢ ((1Q ∈ Q ∧ 1Q ∈ Q) → (1Q +Q 1Q) ∈ Q)
5	3, 3, 4	mp2an 705	. . . . . . . . . 10 ⊢ (1Q +Q 1Q) ∈ Q
6		recidnq 11077	. . . . . . . . . 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 7455	. . . . . . . 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 2786	. . . . . . 7 ⊢ ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
10	9	oveq1i 7453	. . . . . 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 7454	. . . . . . 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 11071	. . . . . . . 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 11065	. . . . . . . . 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 7453	. . . . . . . 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 2788	. . . . . . 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 11078	. . . . . . . . 9 ⊢ ((1Q +Q 1Q) ∈ Q → (*Q‘(1Q +Q 1Q)) ∈ Q)
17		addclnq 11057	. . . . . . . . 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 596	. . . . . . . 8 ⊢ ((1Q +Q 1Q) ∈ Q → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
19		mulidnq 11075	. . . . . . . 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 2794	. . . . . 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 2794	. . . . 5 ⊢ ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) = 1Q
23	22	oveq2i 7454	. . . 4 ⊢ (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
24	1, 23	eqtr3i 2788	. . 3 ⊢ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
25		mulidnq 11075	. . 3 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴)
26	24, 25	eqtrid 2810	. 2 ⊢ (𝐴 ∈ Q → ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴)
27		ovex 7476	. . 3 ⊢ (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∈ V
28		oveq12 7452	. . . . 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 577	. . . 4 ⊢ (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
30	29	eqeq1d 2765	. . 3 ⊢ (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → ((𝑥 +Q 𝑥) = 𝐴 ↔ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴))
31	27, 30	spcev 3564	. 2 ⊢ (((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴 → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)
32	26, 31	syl 18	1 ⊢ (𝐴 ∈ Q → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)

This proof depends on syntax axioms:   → wi 4   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ‘cfv 6558  (class class class)co 7443  Qcnq 10964  1_Qc1q 10965   +_Q cplq 10967   ·_Q cmq 10968  *_Qcrq 10969

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-oadd 8508  df-omul 8509  df-er 8745  df-ni 10984  df-pli 10985  df-mi 10986  df-lti 10987  df-plpq 11020  df-mpq 11021  df-enq 11023  df-nq 11024  df-erq 11025  df-plq 11026  df-mq 11027  df-1nq 11028  df-rq 11029

This theorem is used by:  nsmallnq  11089