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

Theorem suplocexprlemrl 7936
Description: Lemma for suplocexpr 7944. The lower cut of the putative supremum is rounded. (Contributed by Jim Kingdon, 9-Jan-2024.)
Hypotheses
Ref Expression
suplocexpr.m (𝜑 → ∃𝑥 𝑥𝐴)
suplocexpr.ub (𝜑 → ∃𝑥P𝑦𝐴 𝑦<P 𝑥)
suplocexpr.loc (𝜑 → ∀𝑥P𝑦P (𝑥<P 𝑦 → (∃𝑧𝐴 𝑥<P 𝑧 ∨ ∀𝑧𝐴 𝑧<P 𝑦)))
Assertion
Ref Expression
suplocexprlemrl (𝜑 → ∀𝑞Q (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
Distinct variable groups:   𝐴,𝑟   𝑥,𝐴,𝑦   𝜑,𝑞,𝑟   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑧)   𝐴(𝑧,𝑞)

Proof of Theorem suplocexprlemrl
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 suplocexprlemell 7932 . . . . . . 7 (𝑞 (1st𝐴) ↔ ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
21biimpi 120 . . . . . 6 (𝑞 (1st𝐴) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
32adantl 277 . . . . 5 (((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
4 suplocexpr.m . . . . . . . . . . 11 (𝜑 → ∃𝑥 𝑥𝐴)
5 suplocexpr.ub . . . . . . . . . . 11 (𝜑 → ∃𝑥P𝑦𝐴 𝑦<P 𝑥)
6 suplocexpr.loc . . . . . . . . . . 11 (𝜑 → ∀𝑥P𝑦P (𝑥<P 𝑦 → (∃𝑧𝐴 𝑥<P 𝑧 ∨ ∀𝑧𝐴 𝑧<P 𝑦)))
74, 5, 6suplocexprlemss 7934 . . . . . . . . . 10 (𝜑𝐴P)
87ad3antrrr 492 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝐴P)
9 simprl 531 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑠𝐴)
108, 9sseldd 3228 . . . . . . . 8 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑠P)
11 prop 7694 . . . . . . . 8 (𝑠P → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
1210, 11syl 14 . . . . . . 7 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
13 simprr 533 . . . . . . 7 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑞 ∈ (1st𝑠))
14 prnmaxl 7707 . . . . . . 7 ((⟨(1st𝑠), (2nd𝑠)⟩ ∈ P𝑞 ∈ (1st𝑠)) → ∃𝑟 ∈ (1st𝑠)𝑞 <Q 𝑟)
1512, 13, 14syl2anc 411 . . . . . 6 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ∃𝑟 ∈ (1st𝑠)𝑞 <Q 𝑟)
16 ltrelnq 7584 . . . . . . . . 9 <Q ⊆ (Q × Q)
1716brel 4778 . . . . . . . 8 (𝑞 <Q 𝑟 → (𝑞Q𝑟Q))
1817simprd 114 . . . . . . 7 (𝑞 <Q 𝑟𝑟Q)
1918ad2antll 491 . . . . . 6 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟Q)
20 simprr 533 . . . . . . 7 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑞 <Q 𝑟)
21 simplrl 537 . . . . . . . . 9 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑠𝐴)
22 simprl 531 . . . . . . . . 9 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 ∈ (1st𝑠))
23 rspe 2581 . . . . . . . . 9 ((𝑠𝐴𝑟 ∈ (1st𝑠)) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
2421, 22, 23syl2anc 411 . . . . . . . 8 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
25 suplocexprlemell 7932 . . . . . . . 8 (𝑟 (1st𝐴) ↔ ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
2624, 25sylibr 134 . . . . . . 7 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 (1st𝐴))
2720, 26jca 306 . . . . . 6 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → (𝑞 <Q 𝑟𝑟 (1st𝐴)))
2815, 19, 27reximssdv 2636 . . . . 5 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)))
293, 28rexlimddv 2655 . . . 4 (((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)))
3029ex 115 . . 3 ((𝜑𝑞Q) → (𝑞 (1st𝐴) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
31 simprr 533 . . . . . . 7 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → 𝑟 (1st𝐴))
3231, 25sylib 122 . . . . . 6 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
33 simprl 531 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑠𝐴)
34 simplrl 537 . . . . . . . . . 10 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 <Q 𝑟)
357ad3antrrr 492 . . . . . . . . . . . . 13 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝐴P)
3635, 33sseldd 3228 . . . . . . . . . . . 12 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑠P)
3736, 11syl 14 . . . . . . . . . . 11 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
38 simprr 533 . . . . . . . . . . 11 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑟 ∈ (1st𝑠))
39 prcdnql 7703 . . . . . . . . . . 11 ((⟨(1st𝑠), (2nd𝑠)⟩ ∈ P𝑟 ∈ (1st𝑠)) → (𝑞 <Q 𝑟𝑞 ∈ (1st𝑠)))
4037, 38, 39syl2anc 411 . . . . . . . . . 10 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → (𝑞 <Q 𝑟𝑞 ∈ (1st𝑠)))
4134, 40mpd 13 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 ∈ (1st𝑠))
42 19.8a 1638 . . . . . . . . 9 ((𝑠𝐴𝑞 ∈ (1st𝑠)) → ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
4333, 41, 42syl2anc 411 . . . . . . . 8 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
44 df-rex 2516 . . . . . . . 8 (∃𝑠𝐴 𝑞 ∈ (1st𝑠) ↔ ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
4543, 44sylibr 134 . . . . . . 7 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
4645, 1sylibr 134 . . . . . 6 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 (1st𝐴))
4732, 46rexlimddv 2655 . . . . 5 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → 𝑞 (1st𝐴))
4847ex 115 . . . 4 ((𝜑𝑞Q) → ((𝑞 <Q 𝑟𝑟 (1st𝐴)) → 𝑞 (1st𝐴)))
4948rexlimdvw 2654 . . 3 ((𝜑𝑞Q) → (∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)) → 𝑞 (1st𝐴)))
5030, 49impbid 129 . 2 ((𝜑𝑞Q) → (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
5150ralrimiva 2605 1 (𝜑 → ∀𝑞Q (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 715  wex 1540  wcel 2202  wral 2510  wrex 2511  wss 3200  cop 3672   cuni 3893   class class class wbr 4088  cima 4728  cfv 5326  1st c1st 6300  2nd c2nd 6301  Qcnq 7499   <Q cltq 7504  Pcnp 7510  <P cltp 7514
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-1st 6302  df-2nd 6303  df-qs 6707  df-ni 7523  df-nqqs 7567  df-ltnqqs 7572  df-inp 7685  df-iltp 7689
This theorem is referenced by:  suplocexprlemex  7941
  Copyright terms: Public domain W3C validator