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

Theorem ltexprlemupu 7634
Description: The upper cut of our constructed difference is upper. Lemma for ltexpri 7643. (Contributed by Jim Kingdon, 21-Dec-2019.)
Hypothesis
Ref Expression
ltexprlem.1 𝐶 = ⟨{𝑥Q ∣ ∃𝑦(𝑦 ∈ (2nd𝐴) ∧ (𝑦 +Q 𝑥) ∈ (1st𝐵))}, {𝑥Q ∣ ∃𝑦(𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑥) ∈ (2nd𝐵))}⟩
Assertion
Ref Expression
ltexprlemupu ((𝐴<P 𝐵𝑟Q) → (∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶)) → 𝑟 ∈ (2nd𝐶)))
Distinct variable groups:   𝑥,𝑦,𝑞,𝑟,𝐴   𝑥,𝐵,𝑦,𝑞,𝑟   𝑥,𝐶,𝑦,𝑞,𝑟

Proof of Theorem ltexprlemupu
StepHypRef Expression
1 simplr 528 . . . . . 6 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝑟Q)
2 simprrr 540 . . . . . . 7 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)))
32simpld 112 . . . . . 6 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝑦 ∈ (1st𝐴))
4 simprl 529 . . . . . . . 8 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝑞 <Q 𝑟)
5 simpll 527 . . . . . . . . 9 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝐴<P 𝐵)
6 simprrl 539 . . . . . . . . . 10 ((𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)))) → 𝑦 ∈ (1st𝐴))
76adantl 277 . . . . . . . . 9 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝑦 ∈ (1st𝐴))
8 ltrelpr 7535 . . . . . . . . . . . . 13 <P ⊆ (P × P)
98brel 4696 . . . . . . . . . . . 12 (𝐴<P 𝐵 → (𝐴P𝐵P))
109simpld 112 . . . . . . . . . . 11 (𝐴<P 𝐵𝐴P)
11 prop 7505 . . . . . . . . . . 11 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
1210, 11syl 14 . . . . . . . . . 10 (𝐴<P 𝐵 → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
13 elprnql 7511 . . . . . . . . . 10 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑦 ∈ (1st𝐴)) → 𝑦Q)
1412, 13sylan 283 . . . . . . . . 9 ((𝐴<P 𝐵𝑦 ∈ (1st𝐴)) → 𝑦Q)
155, 7, 14syl2anc 411 . . . . . . . 8 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝑦Q)
16 ltanqi 7432 . . . . . . . 8 ((𝑞 <Q 𝑟𝑦Q) → (𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟))
174, 15, 16syl2anc 411 . . . . . . 7 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → (𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟))
189simprd 114 . . . . . . . . 9 (𝐴<P 𝐵𝐵P)
195, 18syl 14 . . . . . . . 8 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → 𝐵P)
202simprd 114 . . . . . . . 8 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → (𝑦 +Q 𝑞) ∈ (2nd𝐵))
21 prop 7505 . . . . . . . . 9 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
22 prcunqu 7515 . . . . . . . . 9 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)) → ((𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟) → (𝑦 +Q 𝑟) ∈ (2nd𝐵)))
2321, 22sylan 283 . . . . . . . 8 ((𝐵P ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)) → ((𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟) → (𝑦 +Q 𝑟) ∈ (2nd𝐵)))
2419, 20, 23syl2anc 411 . . . . . . 7 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → ((𝑦 +Q 𝑞) <Q (𝑦 +Q 𝑟) → (𝑦 +Q 𝑟) ∈ (2nd𝐵)))
2517, 24mpd 13 . . . . . 6 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → (𝑦 +Q 𝑟) ∈ (2nd𝐵))
261, 3, 25jca32 310 . . . . 5 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → (𝑟Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd𝐵))))
2726eximi 1611 . . . 4 (∃𝑦((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) → ∃𝑦(𝑟Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd𝐵))))
28 ltexprlem.1 . . . . . . . . . 10 𝐶 = ⟨{𝑥Q ∣ ∃𝑦(𝑦 ∈ (2nd𝐴) ∧ (𝑦 +Q 𝑥) ∈ (1st𝐵))}, {𝑥Q ∣ ∃𝑦(𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑥) ∈ (2nd𝐵))}⟩
2928ltexprlemelu 7629 . . . . . . . . 9 (𝑞 ∈ (2nd𝐶) ↔ (𝑞Q ∧ ∃𝑦(𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))
30 19.42v 1918 . . . . . . . . 9 (∃𝑦(𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))) ↔ (𝑞Q ∧ ∃𝑦(𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))
3129, 30bitr4i 187 . . . . . . . 8 (𝑞 ∈ (2nd𝐶) ↔ ∃𝑦(𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))
3231anbi2i 457 . . . . . . 7 ((𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶)) ↔ (𝑞 <Q 𝑟 ∧ ∃𝑦(𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)))))
33 19.42v 1918 . . . . . . 7 (∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)))) ↔ (𝑞 <Q 𝑟 ∧ ∃𝑦(𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)))))
3432, 33bitr4i 187 . . . . . 6 ((𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶)) ↔ ∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵)))))
3534anbi2i 457 . . . . 5 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶))) ↔ ((𝐴<P 𝐵𝑟Q) ∧ ∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))))
36 19.42v 1918 . . . . 5 (∃𝑦((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))) ↔ ((𝐴<P 𝐵𝑟Q) ∧ ∃𝑦(𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))))
3735, 36bitr4i 187 . . . 4 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶))) ↔ ∃𝑦((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟 ∧ (𝑞Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑞) ∈ (2nd𝐵))))))
3828ltexprlemelu 7629 . . . . 5 (𝑟 ∈ (2nd𝐶) ↔ (𝑟Q ∧ ∃𝑦(𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd𝐵))))
39 19.42v 1918 . . . . 5 (∃𝑦(𝑟Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd𝐵))) ↔ (𝑟Q ∧ ∃𝑦(𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd𝐵))))
4038, 39bitr4i 187 . . . 4 (𝑟 ∈ (2nd𝐶) ↔ ∃𝑦(𝑟Q ∧ (𝑦 ∈ (1st𝐴) ∧ (𝑦 +Q 𝑟) ∈ (2nd𝐵))))
4127, 37, 403imtr4i 201 . . 3 (((𝐴<P 𝐵𝑟Q) ∧ (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶))) → 𝑟 ∈ (2nd𝐶))
4241ex 115 . 2 ((𝐴<P 𝐵𝑟Q) → ((𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶)) → 𝑟 ∈ (2nd𝐶)))
4342rexlimdvw 2611 1 ((𝐴<P 𝐵𝑟Q) → (∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐶)) → 𝑟 ∈ (2nd𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wex 1503  wcel 2160  wrex 2469  {crab 2472  cop 3610   class class class wbr 4018  cfv 5235  (class class class)co 5897  1st c1st 6164  2nd c2nd 6165  Qcnq 7310   +Q cplq 7312   <Q cltq 7315  Pcnp 7321  <P cltp 7325
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-iinf 4605
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-eprel 4307  df-id 4311  df-iord 4384  df-on 4386  df-suc 4389  df-iom 4608  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-ov 5900  df-oprab 5901  df-mpo 5902  df-1st 6166  df-2nd 6167  df-recs 6331  df-irdg 6396  df-oadd 6446  df-omul 6447  df-er 6560  df-ec 6562  df-qs 6566  df-ni 7334  df-pli 7335  df-mi 7336  df-lti 7337  df-plpq 7374  df-enq 7377  df-nqqs 7378  df-plqqs 7379  df-ltnqqs 7383  df-inp 7496  df-iltp 7500
This theorem is referenced by:  ltexprlemrnd  7635
  Copyright terms: Public domain W3C validator