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

Theorem addextpr 7616
Description: Strong extensionality of addition (ordering version). This is similar to addext 8562 but for positive reals and based on less-than rather than apartness. (Contributed by Jim Kingdon, 17-Feb-2020.)
Assertion
Ref Expression
addextpr (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐷) → (𝐴<P 𝐶𝐵<P 𝐷)))

Proof of Theorem addextpr
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 addclpr 7532 . . . 4 ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)
21adantr 276 . . 3 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐴 +P 𝐵) ∈ P)
3 addclpr 7532 . . . 4 ((𝐶P𝐷P) → (𝐶 +P 𝐷) ∈ P)
43adantl 277 . . 3 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐶 +P 𝐷) ∈ P)
5 simprl 529 . . . 4 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → 𝐶P)
6 simplr 528 . . . 4 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → 𝐵P)
7 addclpr 7532 . . . 4 ((𝐶P𝐵P) → (𝐶 +P 𝐵) ∈ P)
85, 6, 7syl2anc 411 . . 3 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐶 +P 𝐵) ∈ P)
9 ltsopr 7591 . . . 4 <P Or P
10 sowlin 4319 . . . 4 ((<P Or P ∧ ((𝐴 +P 𝐵) ∈ P ∧ (𝐶 +P 𝐷) ∈ P ∧ (𝐶 +P 𝐵) ∈ P)) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐷) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐵) ∨ (𝐶 +P 𝐵)<P (𝐶 +P 𝐷))))
119, 10mpan 424 . . 3 (((𝐴 +P 𝐵) ∈ P ∧ (𝐶 +P 𝐷) ∈ P ∧ (𝐶 +P 𝐵) ∈ P) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐷) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐵) ∨ (𝐶 +P 𝐵)<P (𝐶 +P 𝐷))))
122, 4, 8, 11syl3anc 1238 . 2 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐷) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐵) ∨ (𝐶 +P 𝐵)<P (𝐶 +P 𝐷))))
13 simpll 527 . . . . 5 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → 𝐴P)
14 ltaprg 7614 . . . . 5 ((𝐴P𝐶P𝐵P) → (𝐴<P 𝐶 ↔ (𝐵 +P 𝐴)<P (𝐵 +P 𝐶)))
1513, 5, 6, 14syl3anc 1238 . . . 4 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐴<P 𝐶 ↔ (𝐵 +P 𝐴)<P (𝐵 +P 𝐶)))
16 addcomprg 7573 . . . . . . 7 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1716adantl 277 . . . . . 6 ((((𝐴P𝐵P) ∧ (𝐶P𝐷P)) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1817, 13, 6caovcomd 6027 . . . . 5 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐴 +P 𝐵) = (𝐵 +P 𝐴))
1917, 5, 6caovcomd 6027 . . . . 5 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐶 +P 𝐵) = (𝐵 +P 𝐶))
2018, 19breq12d 4015 . . . 4 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐵) ↔ (𝐵 +P 𝐴)<P (𝐵 +P 𝐶)))
2115, 20bitr4d 191 . . 3 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐴<P 𝐶 ↔ (𝐴 +P 𝐵)<P (𝐶 +P 𝐵)))
22 simprr 531 . . . 4 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → 𝐷P)
23 ltaprg 7614 . . . 4 ((𝐵P𝐷P𝐶P) → (𝐵<P 𝐷 ↔ (𝐶 +P 𝐵)<P (𝐶 +P 𝐷)))
246, 22, 5, 23syl3anc 1238 . . 3 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (𝐵<P 𝐷 ↔ (𝐶 +P 𝐵)<P (𝐶 +P 𝐷)))
2521, 24orbi12d 793 . 2 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → ((𝐴<P 𝐶𝐵<P 𝐷) ↔ ((𝐴 +P 𝐵)<P (𝐶 +P 𝐵) ∨ (𝐶 +P 𝐵)<P (𝐶 +P 𝐷))))
2612, 25sylibrd 169 1 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → ((𝐴 +P 𝐵)<P (𝐶 +P 𝐷) → (𝐴<P 𝐶𝐵<P 𝐷)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 708  w3a 978   = wceq 1353  wcel 2148   class class class wbr 4002   Or wor 4294  (class class class)co 5871  Pcnp 7286   +P cpp 7288  <P cltp 7290
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4117  ax-sep 4120  ax-nul 4128  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-iinf 4586
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4003  df-opab 4064  df-mpt 4065  df-tr 4101  df-eprel 4288  df-id 4292  df-po 4295  df-iso 4296  df-iord 4365  df-on 4367  df-suc 4370  df-iom 4589  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5176  df-fun 5216  df-fn 5217  df-f 5218  df-f1 5219  df-fo 5220  df-f1o 5221  df-fv 5222  df-ov 5874  df-oprab 5875  df-mpo 5876  df-1st 6137  df-2nd 6138  df-recs 6302  df-irdg 6367  df-1o 6413  df-2o 6414  df-oadd 6417  df-omul 6418  df-er 6531  df-ec 6533  df-qs 6537  df-ni 7299  df-pli 7300  df-mi 7301  df-lti 7302  df-plpq 7339  df-mpq 7340  df-enq 7342  df-nqqs 7343  df-plqqs 7344  df-mqqs 7345  df-1nqqs 7346  df-rq 7347  df-ltnqqs 7348  df-enq0 7419  df-nq0 7420  df-0nq0 7421  df-plq0 7422  df-mq0 7423  df-inp 7461  df-iplp 7463  df-iltp 7465
This theorem is referenced by:  mulextsr1lem  7775
  Copyright terms: Public domain W3C validator