Theorem ltaddnq 10965

Description: The sum of two fractions is greater than one of them. (Contributed by NM, 14-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
ltaddnq	⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → 𝐴 <Q (𝐴 +Q 𝐵))

Proof of Theorem ltaddnq

Dummy variables 𝑥 𝑦 𝑠 𝑟 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
2		oveq1 7412	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 +Q 𝑦) = (𝐴 +Q 𝑦))
3	1, 2	breq12d 5160	. 2 ⊢ (𝑥 = 𝐴 → (𝑥 <Q (𝑥 +Q 𝑦) ↔ 𝐴 <Q (𝐴 +Q 𝑦)))
4		oveq2 7413	. . 3 ⊢ (𝑦 = 𝐵 → (𝐴 +Q 𝑦) = (𝐴 +Q 𝐵))
5	4	breq2d 5159	. 2 ⊢ (𝑦 = 𝐵 → (𝐴 <Q (𝐴 +Q 𝑦) ↔ 𝐴 <Q (𝐴 +Q 𝐵)))
6		1lt2nq 10964	. . . . . . . 8 ⊢ 1Q <Q (1Q +Q 1Q)
7		ltmnq 10963	. . . . . . . 8 ⊢ (𝑦 ∈ Q → (1Q <Q (1Q +Q 1Q) ↔ (𝑦 ·Q 1Q) <Q (𝑦 ·Q (1Q +Q 1Q))))
8	6, 7	mpbii 232	. . . . . . 7 ⊢ (𝑦 ∈ Q → (𝑦 ·Q 1Q) <Q (𝑦 ·Q (1Q +Q 1Q)))
9		mulidnq 10954	. . . . . . 7 ⊢ (𝑦 ∈ Q → (𝑦 ·Q 1Q) = 𝑦)
10		distrnq 10952	. . . . . . . 8 ⊢ (𝑦 ·Q (1Q +Q 1Q)) = ((𝑦 ·Q 1Q) +Q (𝑦 ·Q 1Q))
11	9, 9	oveq12d 7423	. . . . . . . 8 ⊢ (𝑦 ∈ Q → ((𝑦 ·Q 1Q) +Q (𝑦 ·Q 1Q)) = (𝑦 +Q 𝑦))
12	10, 11	eqtrid 2784	. . . . . . 7 ⊢ (𝑦 ∈ Q → (𝑦 ·Q (1Q +Q 1Q)) = (𝑦 +Q 𝑦))
13	8, 9, 12	3brtr3d 5178	. . . . . 6 ⊢ (𝑦 ∈ Q → 𝑦 <Q (𝑦 +Q 𝑦))
14		ltanq 10962	. . . . . 6 ⊢ (𝑥 ∈ Q → (𝑦 <Q (𝑦 +Q 𝑦) ↔ (𝑥 +Q 𝑦) <Q (𝑥 +Q (𝑦 +Q 𝑦))))
15	13, 14	imbitrid 243	. . . . 5 ⊢ (𝑥 ∈ Q → (𝑦 ∈ Q → (𝑥 +Q 𝑦) <Q (𝑥 +Q (𝑦 +Q 𝑦))))
16	15	imp 407	. . . 4 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥 +Q 𝑦) <Q (𝑥 +Q (𝑦 +Q 𝑦)))
17		addcomnq 10942	. . . 4 ⊢ (𝑥 +Q 𝑦) = (𝑦 +Q 𝑥)
18		vex 3478	. . . . 5 ⊢ 𝑥 ∈ V
19		vex 3478	. . . . 5 ⊢ 𝑦 ∈ V
20		addcomnq 10942	. . . . 5 ⊢ (𝑟 +Q 𝑠) = (𝑠 +Q 𝑟)
21		addassnq 10949	. . . . 5 ⊢ ((𝑟 +Q 𝑠) +Q 𝑡) = (𝑟 +Q (𝑠 +Q 𝑡))
22	18, 19, 19, 20, 21	caov12 7631	. . . 4 ⊢ (𝑥 +Q (𝑦 +Q 𝑦)) = (𝑦 +Q (𝑥 +Q 𝑦))
23	16, 17, 22	3brtr3g 5180	. . 3 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑦 +Q 𝑥) <Q (𝑦 +Q (𝑥 +Q 𝑦)))
24		ltanq 10962	. . . 4 ⊢ (𝑦 ∈ Q → (𝑥 <Q (𝑥 +Q 𝑦) ↔ (𝑦 +Q 𝑥) <Q (𝑦 +Q (𝑥 +Q 𝑦))))
25	24	adantl 482	. . 3 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥 <Q (𝑥 +Q 𝑦) ↔ (𝑦 +Q 𝑥) <Q (𝑦 +Q (𝑥 +Q 𝑦))))
26	23, 25	mpbird 256	. 2 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → 𝑥 <Q (𝑥 +Q 𝑦))
27	3, 5, 26	vtocl2ga 3566	1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → 𝐴 <Q (𝐴 +Q 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106   class class class wbr 5147  (class class class)co 7405  Qcnq 10843  1_Qc1q 10844   +_Q cplq 10846   ·_Q cmq 10847   <_Q cltq 10849

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-ltpq 10901  df-enq 10902  df-nq 10903  df-erq 10904  df-plq 10905  df-mq 10906  df-1nq 10907  df-ltnq 10909

This theorem is referenced by:  ltexnq  10966  nsmallnq  10968  ltbtwnnq  10969  prlem934  11024  ltaddpr  11025  ltexprlem2  11028  ltexprlem4  11030