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

Theorem halfnq 10877
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
StepHypRef Expression
1 distrnq 10862 . . . 4 (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q))))
2 distrnq 10862 . . . . . . . 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 10829 . . . . . . . . . . 11 1QQ
4 addclnq 10846 . . . . . . . . . . 11 ((1QQ ∧ 1QQ) → (1Q +Q 1Q) ∈ Q)
53, 3, 4mp2an 692 . . . . . . . . . 10 (1Q +Q 1Q) ∈ Q
6 recidnq 10866 . . . . . . . . . 10 ((1Q +Q 1Q) ∈ Q → ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) = 1Q)
75, 6ax-mp 5 . . . . . . . . 9 ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) = 1Q
87, 7oveq12i 7367 . . . . . . . 8 (((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) +Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
92, 8eqtri 2756 . . . . . . 7 ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
109oveq1i 7365 . . . . . 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)))
117oveq2i 7366 . . . . . . 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 10860 . . . . . . . 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 10854 . . . . . . . . 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))))
1413oveq1i 7365 . . . . . . . 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)))
1512, 14eqtr3i 2758 . . . . . . 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 10867 . . . . . . . . 9 ((1Q +Q 1Q) ∈ Q → (*Q‘(1Q +Q 1Q)) ∈ Q)
17 addclnq 10846 . . . . . . . . 9 (((*Q‘(1Q +Q 1Q)) ∈ Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q) → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
1816, 16, 17syl2anc 584 . . . . . . . 8 ((1Q +Q 1Q) ∈ Q → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
19 mulidnq 10864 . . . . . . . 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))))
205, 18, 19mp2b 10 . . . . . . 7 (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q 1Q) = ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))
2111, 15, 203eqtr3i 2764 . . . . . 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)))
2210, 21, 73eqtr3i 2764 . . . . 5 ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) = 1Q
2322oveq2i 7366 . . . 4 (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
241, 23eqtr3i 2758 . . 3 ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
25 mulidnq 10864 . . 3 (𝐴Q → (𝐴 ·Q 1Q) = 𝐴)
2624, 25eqtrid 2780 . 2 (𝐴Q → ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴)
27 ovex 7388 . . 3 (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∈ V
28 oveq12 7364 . . . . 5 ((𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∧ 𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
2928anidms 566 . . . 4 (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
3029eqeq1d 2735 . . 3 (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → ((𝑥 +Q 𝑥) = 𝐴 ↔ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴))
3127, 30spcev 3558 . 2 (((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴 → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)
3226, 31syl 17 1 (𝐴Q → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wex 1780  wcel 2113  cfv 6489  (class class class)co 7355  Qcnq 10753  1Qc1q 10754   +Q cplq 10756   ·Q cmq 10757  *Qcrq 10758
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7677
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-oadd 8398  df-omul 8399  df-er 8631  df-ni 10773  df-pli 10774  df-mi 10775  df-lti 10776  df-plpq 10809  df-mpq 10810  df-enq 10812  df-nq 10813  df-erq 10814  df-plq 10815  df-mq 10816  df-1nq 10817  df-rq 10818
This theorem is referenced by:  nsmallnq  10878
  Copyright terms: Public domain W3C validator