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

Theorem ltaddpr 10171
Description: The sum of two positive reals is greater than one of them. Proposition 9-3.5(iii) of [Gleason] p. 123. (Contributed by NM, 26-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
Assertion
Ref Expression
ltaddpr ((𝐴P𝐵P) → 𝐴<P (𝐴 +P 𝐵))

Proof of Theorem ltaddpr
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prn0 10126 . . . . 5 (𝐵P𝐵 ≠ ∅)
2 n0 4160 . . . . 5 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
31, 2sylib 210 . . . 4 (𝐵P → ∃𝑦 𝑦𝐵)
43adantl 475 . . 3 ((𝐴P𝐵P) → ∃𝑦 𝑦𝐵)
5 addclpr 10155 . . . . . . . . . . . 12 ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)
65adantr 474 . . . . . . . . . . 11 (((𝐴P𝐵P) ∧ (𝑥𝐴𝑦𝐵)) → (𝐴 +P 𝐵) ∈ P)
7 df-plp 10120 . . . . . . . . . . . . 13 +P = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦 +Q 𝑧)})
8 addclnq 10082 . . . . . . . . . . . . 13 ((𝑦Q𝑧Q) → (𝑦 +Q 𝑧) ∈ Q)
97, 8genpprecl 10138 . . . . . . . . . . . 12 ((𝐴P𝐵P) → ((𝑥𝐴𝑦𝐵) → (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵)))
109imp 397 . . . . . . . . . . 11 (((𝐴P𝐵P) ∧ (𝑥𝐴𝑦𝐵)) → (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵))
11 elprnq 10128 . . . . . . . . . . . . 13 (((𝐴 +P 𝐵) ∈ P ∧ (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵)) → (𝑥 +Q 𝑦) ∈ Q)
12 addnqf 10085 . . . . . . . . . . . . . . 15 +Q :(Q × Q)⟶Q
1312fdmi 6288 . . . . . . . . . . . . . 14 dom +Q = (Q × Q)
14 0nnq 10061 . . . . . . . . . . . . . 14 ¬ ∅ ∈ Q
1513, 14ndmovrcl 7080 . . . . . . . . . . . . 13 ((𝑥 +Q 𝑦) ∈ Q → (𝑥Q𝑦Q))
16 ltaddnq 10111 . . . . . . . . . . . . 13 ((𝑥Q𝑦Q) → 𝑥 <Q (𝑥 +Q 𝑦))
1711, 15, 163syl 18 . . . . . . . . . . . 12 (((𝐴 +P 𝐵) ∈ P ∧ (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵)) → 𝑥 <Q (𝑥 +Q 𝑦))
18 prcdnq 10130 . . . . . . . . . . . 12 (((𝐴 +P 𝐵) ∈ P ∧ (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵)) → (𝑥 <Q (𝑥 +Q 𝑦) → 𝑥 ∈ (𝐴 +P 𝐵)))
1917, 18mpd 15 . . . . . . . . . . 11 (((𝐴 +P 𝐵) ∈ P ∧ (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵)) → 𝑥 ∈ (𝐴 +P 𝐵))
206, 10, 19syl2anc 581 . . . . . . . . . 10 (((𝐴P𝐵P) ∧ (𝑥𝐴𝑦𝐵)) → 𝑥 ∈ (𝐴 +P 𝐵))
2120exp32 413 . . . . . . . . 9 ((𝐴P𝐵P) → (𝑥𝐴 → (𝑦𝐵𝑥 ∈ (𝐴 +P 𝐵))))
2221com23 86 . . . . . . . 8 ((𝐴P𝐵P) → (𝑦𝐵 → (𝑥𝐴𝑥 ∈ (𝐴 +P 𝐵))))
2322alrimdv 2030 . . . . . . 7 ((𝐴P𝐵P) → (𝑦𝐵 → ∀𝑥(𝑥𝐴𝑥 ∈ (𝐴 +P 𝐵))))
24 dfss2 3815 . . . . . . 7 (𝐴 ⊆ (𝐴 +P 𝐵) ↔ ∀𝑥(𝑥𝐴𝑥 ∈ (𝐴 +P 𝐵)))
2523, 24syl6ibr 244 . . . . . 6 ((𝐴P𝐵P) → (𝑦𝐵𝐴 ⊆ (𝐴 +P 𝐵)))
26 vex 3417 . . . . . . . . 9 𝑦 ∈ V
2726prlem934 10170 . . . . . . . 8 (𝐴P → ∃𝑥𝐴 ¬ (𝑥 +Q 𝑦) ∈ 𝐴)
2827adantr 474 . . . . . . 7 ((𝐴P𝐵P) → ∃𝑥𝐴 ¬ (𝑥 +Q 𝑦) ∈ 𝐴)
29 eleq2 2895 . . . . . . . . . . . . 13 (𝐴 = (𝐴 +P 𝐵) → ((𝑥 +Q 𝑦) ∈ 𝐴 ↔ (𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵)))
3029biimprcd 242 . . . . . . . . . . . 12 ((𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵) → (𝐴 = (𝐴 +P 𝐵) → (𝑥 +Q 𝑦) ∈ 𝐴))
3130con3d 150 . . . . . . . . . . 11 ((𝑥 +Q 𝑦) ∈ (𝐴 +P 𝐵) → (¬ (𝑥 +Q 𝑦) ∈ 𝐴 → ¬ 𝐴 = (𝐴 +P 𝐵)))
329, 31syl6 35 . . . . . . . . . 10 ((𝐴P𝐵P) → ((𝑥𝐴𝑦𝐵) → (¬ (𝑥 +Q 𝑦) ∈ 𝐴 → ¬ 𝐴 = (𝐴 +P 𝐵))))
3332expd 406 . . . . . . . . 9 ((𝐴P𝐵P) → (𝑥𝐴 → (𝑦𝐵 → (¬ (𝑥 +Q 𝑦) ∈ 𝐴 → ¬ 𝐴 = (𝐴 +P 𝐵)))))
3433com34 91 . . . . . . . 8 ((𝐴P𝐵P) → (𝑥𝐴 → (¬ (𝑥 +Q 𝑦) ∈ 𝐴 → (𝑦𝐵 → ¬ 𝐴 = (𝐴 +P 𝐵)))))
3534rexlimdv 3239 . . . . . . 7 ((𝐴P𝐵P) → (∃𝑥𝐴 ¬ (𝑥 +Q 𝑦) ∈ 𝐴 → (𝑦𝐵 → ¬ 𝐴 = (𝐴 +P 𝐵))))
3628, 35mpd 15 . . . . . 6 ((𝐴P𝐵P) → (𝑦𝐵 → ¬ 𝐴 = (𝐴 +P 𝐵)))
3725, 36jcad 510 . . . . 5 ((𝐴P𝐵P) → (𝑦𝐵 → (𝐴 ⊆ (𝐴 +P 𝐵) ∧ ¬ 𝐴 = (𝐴 +P 𝐵))))
38 dfpss2 3918 . . . . 5 (𝐴 ⊊ (𝐴 +P 𝐵) ↔ (𝐴 ⊆ (𝐴 +P 𝐵) ∧ ¬ 𝐴 = (𝐴 +P 𝐵)))
3937, 38syl6ibr 244 . . . 4 ((𝐴P𝐵P) → (𝑦𝐵𝐴 ⊊ (𝐴 +P 𝐵)))
4039exlimdv 2034 . . 3 ((𝐴P𝐵P) → (∃𝑦 𝑦𝐵𝐴 ⊊ (𝐴 +P 𝐵)))
414, 40mpd 15 . 2 ((𝐴P𝐵P) → 𝐴 ⊊ (𝐴 +P 𝐵))
42 ltprord 10167 . . 3 ((𝐴P ∧ (𝐴 +P 𝐵) ∈ P) → (𝐴<P (𝐴 +P 𝐵) ↔ 𝐴 ⊊ (𝐴 +P 𝐵)))
435, 42syldan 587 . 2 ((𝐴P𝐵P) → (𝐴<P (𝐴 +P 𝐵) ↔ 𝐴 ⊊ (𝐴 +P 𝐵)))
4441, 43mpbird 249 1 ((𝐴P𝐵P) → 𝐴<P (𝐴 +P 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 386  wal 1656   = wceq 1658  wex 1880  wcel 2166  wne 2999  wrex 3118  wss 3798  wpss 3799  c0 4144   class class class wbr 4873   × cxp 5340  (class class class)co 6905  Qcnq 9989   +Q cplq 9992   <Q cltq 9995  Pcnp 9996   +P cpp 9998  <P cltp 10000
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-sep 5005  ax-nul 5013  ax-pow 5065  ax-pr 5127  ax-un 7209  ax-inf2 8815
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3or 1114  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rmo 3125  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-pss 3814  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-tp 4402  df-op 4404  df-uni 4659  df-int 4698  df-iun 4742  df-br 4874  df-opab 4936  df-mpt 4953  df-tr 4976  df-id 5250  df-eprel 5255  df-po 5263  df-so 5264  df-fr 5301  df-we 5303  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-rn 5353  df-res 5354  df-ima 5355  df-pred 5920  df-ord 5966  df-on 5967  df-lim 5968  df-suc 5969  df-iota 6086  df-fun 6125  df-fn 6126  df-f 6127  df-f1 6128  df-fo 6129  df-f1o 6130  df-fv 6131  df-ov 6908  df-oprab 6909  df-mpt2 6910  df-om 7327  df-1st 7428  df-2nd 7429  df-wrecs 7672  df-recs 7734  df-rdg 7772  df-1o 7826  df-oadd 7830  df-omul 7831  df-er 8009  df-ni 10009  df-pli 10010  df-mi 10011  df-lti 10012  df-plpq 10045  df-mpq 10046  df-ltpq 10047  df-enq 10048  df-nq 10049  df-erq 10050  df-plq 10051  df-mq 10052  df-1nq 10053  df-rq 10054  df-ltnq 10055  df-np 10118  df-plp 10120  df-ltp 10122
This theorem is referenced by:  ltaddpr2  10172  ltexprlem7  10179  ltaprlem  10181  0lt1sr  10232  mappsrpr  10245
  Copyright terms: Public domain W3C validator