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

Theorem suplocexprlemrl 7927
Description: Lemma for suplocexpr 7935. 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 7923 . . . . . . 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 7925 . . . . . . . . . 10 (𝜑𝐴P)
87ad3antrrr 492 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝐴P)
9 simprl 529 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑠𝐴)
108, 9sseldd 3226 . . . . . . . 8 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑠P)
11 prop 7685 . . . . . . . 8 (𝑠P → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
1210, 11syl 14 . . . . . . 7 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
13 simprr 531 . . . . . . 7 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → 𝑞 ∈ (1st𝑠))
14 prnmaxl 7698 . . . . . . 7 ((⟨(1st𝑠), (2nd𝑠)⟩ ∈ P𝑞 ∈ (1st𝑠)) → ∃𝑟 ∈ (1st𝑠)𝑞 <Q 𝑟)
1512, 13, 14syl2anc 411 . . . . . 6 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ∃𝑟 ∈ (1st𝑠)𝑞 <Q 𝑟)
16 ltrelnq 7575 . . . . . . . . 9 <Q ⊆ (Q × Q)
1716brel 4776 . . . . . . . 8 (𝑞 <Q 𝑟 → (𝑞Q𝑟Q))
1817simprd 114 . . . . . . 7 (𝑞 <Q 𝑟𝑟Q)
1918ad2antll 491 . . . . . 6 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟Q)
20 simprr 531 . . . . . . 7 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑞 <Q 𝑟)
21 simplrl 535 . . . . . . . . 9 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑠𝐴)
22 simprl 529 . . . . . . . . 9 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 ∈ (1st𝑠))
23 rspe 2579 . . . . . . . . 9 ((𝑠𝐴𝑟 ∈ (1st𝑠)) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
2421, 22, 23syl2anc 411 . . . . . . . 8 (((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) ∧ (𝑟 ∈ (1st𝑠) ∧ 𝑞 <Q 𝑟)) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
25 suplocexprlemell 7923 . . . . . . . 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 2634 . . . . 5 ((((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) ∧ (𝑠𝐴𝑞 ∈ (1st𝑠))) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)))
293, 28rexlimddv 2653 . . . 4 (((𝜑𝑞Q) ∧ 𝑞 (1st𝐴)) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)))
3029ex 115 . . 3 ((𝜑𝑞Q) → (𝑞 (1st𝐴) → ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
31 simprr 531 . . . . . . 7 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → 𝑟 (1st𝐴))
3231, 25sylib 122 . . . . . 6 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → ∃𝑠𝐴 𝑟 ∈ (1st𝑠))
33 simprl 529 . . . . . . . . 9 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑠𝐴)
34 simplrl 535 . . . . . . . . . 10 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 <Q 𝑟)
357ad3antrrr 492 . . . . . . . . . . . . 13 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝐴P)
3635, 33sseldd 3226 . . . . . . . . . . . 12 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑠P)
3736, 11syl 14 . . . . . . . . . . 11 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ⟨(1st𝑠), (2nd𝑠)⟩ ∈ P)
38 simprr 531 . . . . . . . . . . 11 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑟 ∈ (1st𝑠))
39 prcdnql 7694 . . . . . . . . . . 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 1636 . . . . . . . . 9 ((𝑠𝐴𝑞 ∈ (1st𝑠)) → ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
4333, 41, 42syl2anc 411 . . . . . . . 8 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
44 df-rex 2514 . . . . . . . 8 (∃𝑠𝐴 𝑞 ∈ (1st𝑠) ↔ ∃𝑠(𝑠𝐴𝑞 ∈ (1st𝑠)))
4543, 44sylibr 134 . . . . . . 7 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → ∃𝑠𝐴 𝑞 ∈ (1st𝑠))
4645, 1sylibr 134 . . . . . 6 ((((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) ∧ (𝑠𝐴𝑟 ∈ (1st𝑠))) → 𝑞 (1st𝐴))
4732, 46rexlimddv 2653 . . . . 5 (((𝜑𝑞Q) ∧ (𝑞 <Q 𝑟𝑟 (1st𝐴))) → 𝑞 (1st𝐴))
4847ex 115 . . . 4 ((𝜑𝑞Q) → ((𝑞 <Q 𝑟𝑟 (1st𝐴)) → 𝑞 (1st𝐴)))
4948rexlimdvw 2652 . . 3 ((𝜑𝑞Q) → (∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴)) → 𝑞 (1st𝐴)))
5030, 49impbid 129 . 2 ((𝜑𝑞Q) → (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
5150ralrimiva 2603 1 (𝜑 → ∀𝑞Q (𝑞 (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 (1st𝐴))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 713  wex 1538  wcel 2200  wral 2508  wrex 2509  wss 3198  cop 3670   cuni 3891   class class class wbr 4086  cima 4726  cfv 5324  1st c1st 6296  2nd c2nd 6297  Qcnq 7490   <Q cltq 7495  Pcnp 7501  <P cltp 7505
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1st 6298  df-2nd 6299  df-qs 6703  df-ni 7514  df-nqqs 7558  df-ltnqqs 7563  df-inp 7676  df-iltp 7680
This theorem is referenced by:  suplocexprlemex  7932
  Copyright terms: Public domain W3C validator