ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  halfnqq GIF version

Theorem halfnqq 7767
Description: One-half of any positive fraction is a fraction. (Contributed by Jim Kingdon, 23-Sep-2019.)
Assertion
Ref Expression
halfnqq (𝐴Q → ∃𝑥Q (𝑥 +Q 𝑥) = 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem halfnqq
StepHypRef Expression
1 1nq 7723 . . . . . . . . 9 1QQ
2 addclnq 7732 . . . . . . . . 9 ((1QQ ∧ 1QQ) → (1Q +Q 1Q) ∈ Q)
31, 1, 2mp2an 430 . . . . . . . 8 (1Q +Q 1Q) ∈ Q
4 recclnq 7749 . . . . . . . . 9 ((1Q +Q 1Q) ∈ Q → (*Q‘(1Q +Q 1Q)) ∈ Q)
53, 4ax-mp 5 . . . . . . . 8 (*Q‘(1Q +Q 1Q)) ∈ Q
6 distrnqg 7744 . . . . . . . 8 (((1Q +Q 1Q) ∈ Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q) → ((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)))))
73, 5, 5, 6mp3an 1378 . . . . . . 7 ((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))))
8 recidnq 7750 . . . . . . . . 9 ((1Q +Q 1Q) ∈ Q → ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) = 1Q)
93, 8ax-mp 5 . . . . . . . 8 ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) = 1Q
109, 9oveq12i 6087 . . . . . . 7 (((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))) +Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
117, 10eqtri 2259 . . . . . 6 ((1Q +Q 1Q) ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (1Q +Q 1Q)
1211oveq1i 6085 . . . . 5 (((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)))
139oveq2i 6086 . . . . . 6 (((*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)
14 addclnq 7732 . . . . . . . . 9 (((*Q‘(1Q +Q 1Q)) ∈ Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q) → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
155, 5, 14mp2an 430 . . . . . . . 8 ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q
16 mulassnqg 7741 . . . . . . . 8 ((((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q ∧ (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))) = (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q ((1Q +Q 1Q) ·Q (*Q‘(1Q +Q 1Q)))))
1715, 3, 5, 16mp3an 1378 . . . . . . 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 +Q 1Q) ·Q (*Q‘(1Q +Q 1Q))))
18 mulcomnqg 7740 . . . . . . . . 9 ((((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q ∧ (1Q +Q 1Q) ∈ Q) → (((*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)))))
1915, 3, 18mp2an 430 . . . . . . . 8 (((*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))))
2019oveq1i 6085 . . . . . . 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)))
2117, 20eqtr3i 2261 . . . . . 6 (((*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)))
224, 4, 14syl2anc 415 . . . . . . 7 ((1Q +Q 1Q) ∈ Q → ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ∈ Q)
23 mulidnq 7746 . . . . . . 7 (((*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))))
243, 22, 23mp2b 8 . . . . . 6 (((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) ·Q 1Q) = ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))
2513, 21, 243eqtr3i 2267 . . . . 5 (((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)))
2612, 25, 93eqtr3i 2267 . . . 4 ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q))) = 1Q
2726oveq2i 6086 . . 3 (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = (𝐴 ·Q 1Q)
28 distrnqg 7744 . . . 4 ((𝐴Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q) → (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
295, 5, 28mp3an23 1370 . . 3 (𝐴Q → (𝐴 ·Q ((*Q‘(1Q +Q 1Q)) +Q (*Q‘(1Q +Q 1Q)))) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
30 mulidnq 7746 . . 3 (𝐴Q → (𝐴 ·Q 1Q) = 𝐴)
3127, 29, 303eqtr3a 2295 . 2 (𝐴Q → ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴)
32 mulclnq 7733 . . . 4 ((𝐴Q ∧ (*Q‘(1Q +Q 1Q)) ∈ Q) → (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∈ Q)
335, 32mpan2 429 . . 3 (𝐴Q → (𝐴 ·Q (*Q‘(1Q +Q 1Q))) ∈ Q)
34 id 19 . . . . . 6 (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → 𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))))
3534, 34oveq12d 6093 . . . . 5 (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → (𝑥 +Q 𝑥) = ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))))
3635eqeq1d 2247 . . . 4 (𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q))) → ((𝑥 +Q 𝑥) = 𝐴 ↔ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴))
3736adantl 277 . . 3 ((𝐴Q𝑥 = (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) → ((𝑥 +Q 𝑥) = 𝐴 ↔ ((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴))
3833, 37rspcedv 2933 . 2 (𝐴Q → (((𝐴 ·Q (*Q‘(1Q +Q 1Q))) +Q (𝐴 ·Q (*Q‘(1Q +Q 1Q)))) = 𝐴 → ∃𝑥Q (𝑥 +Q 𝑥) = 𝐴))
3931, 38mpd 13 1 (𝐴Q → ∃𝑥Q (𝑥 +Q 𝑥) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1402  wcel 2209  wrex 2529  cfv 5372  (class class class)co 6075  Qcnq 7637  1Qc1q 7638   +Q cplq 7639   ·Q cmq 7640  *Qcrq 7641
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-1o 6677  df-oadd 6681  df-omul 6682  df-er 6797  df-ec 6799  df-qs 6803  df-ni 7661  df-pli 7662  df-mi 7663  df-plpq 7701  df-mpq 7702  df-enq 7704  df-nqqs 7705  df-plqqs 7706  df-mqqs 7707  df-1nqqs 7708  df-rq 7709
This theorem is referenced by:  halfnq  7768  nsmallnqq  7769  subhalfnqq  7771  addlocpr  7893  addcanprleml  7971  addcanprlemu  7972  cauappcvgprlemm  8002  cauappcvgprlem1  8016  caucvgprlemm  8025
  Copyright terms: Public domain W3C validator