Theorem suplocexprlemrl 8085

Description: Lemma for suplocexpr 8093. 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.

Step	Hyp	Ref	Expression
1		suplocexprlemell 8081	. . . . . . 7 ⊢ (𝑞 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
2	1	biimpi 120	. . . . . 6 ⊢ (𝑞 ∈ ∪ (1st “ 𝐴) → ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
3	2	adantl 277	. . . . 5 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) → ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
4		suplocexpr.m	. . . . . . . . . . 11 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
5		suplocexpr.ub	. . . . . . . . . . 11 ⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
6		suplocexpr.loc	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
7	4, 5, 6	suplocexprlemss 8083	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ P)
8	7	ad3antrrr 496	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝐴 ⊆ P)
9		simprl 535	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑠 ∈ 𝐴)
10	8, 9	sseldd 3249	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑠 ∈ P)
11		prop 7843	. . . . . . . 8 ⊢ (𝑠 ∈ P → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
12	10, 11	syl 14	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
13		simprr 537	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (1st ‘𝑠))
14		prnmaxl 7856	. . . . . . 7 ⊢ ((⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P ∧ 𝑞 ∈ (1st ‘𝑠)) → ∃𝑟 ∈ (1st ‘𝑠)𝑞 <Q 𝑟)
15	12, 13, 14	syl2anc 415	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ∃𝑟 ∈ (1st ‘𝑠)𝑞 <Q 𝑟)
16		ltrelnq 7733	. . . . . . . . 9 ⊢ <Q ⊆ (Q × Q)
17	16	brel 4827	. . . . . . . 8 ⊢ (𝑞 <Q 𝑟 → (𝑞 ∈ Q ∧ 𝑟 ∈ Q))
18	17	simprd 114	. . . . . . 7 ⊢ (𝑞 <Q 𝑟 → 𝑟 ∈ Q)
19	18	ad2antll 495	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 ∈ Q)
20		simprr 537	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑞 <Q 𝑟)
21		simplrl 541	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑠 ∈ 𝐴)
22		simprl 535	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 ∈ (1st ‘𝑠))
23		rspe 2599	. . . . . . . . 9 ⊢ ((𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠)) → ∃𝑠 ∈ 𝐴 𝑟 ∈ (1st ‘𝑠))
24	21, 22, 23	syl2anc 415	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → ∃𝑠 ∈ 𝐴 𝑟 ∈ (1st ‘𝑠))
25		suplocexprlemell 8081	. . . . . . . 8 ⊢ (𝑟 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑠 ∈ 𝐴 𝑟 ∈ (1st ‘𝑠))
26	24, 25	sylibr 134	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → 𝑟 ∈ ∪ (1st “ 𝐴))
27	20, 26	jca 306	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑟 ∈ (1st ‘𝑠) ∧ 𝑞 <Q 𝑟)) → (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴)))
28	15, 19, 27	reximssdv 2654	. . . . 5 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴)))
29	3, 28	rexlimddv 2673	. . . 4 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ 𝑞 ∈ ∪ (1st “ 𝐴)) → ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴)))
30	29	ex 115	. . 3 ⊢ ((𝜑 ∧ 𝑞 ∈ Q) → (𝑞 ∈ ∪ (1st “ 𝐴) → ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))))
31		simprr 537	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) → 𝑟 ∈ ∪ (1st “ 𝐴))
32	31, 25	sylib 122	. . . . . 6 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) → ∃𝑠 ∈ 𝐴 𝑟 ∈ (1st ‘𝑠))
33		simprl 535	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝑠 ∈ 𝐴)
34		simplrl 541	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝑞 <Q 𝑟)
35	7	ad3antrrr 496	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝐴 ⊆ P)
36	35, 33	sseldd 3249	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝑠 ∈ P)
37	36, 11	syl 14	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
38		simprr 537	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝑟 ∈ (1st ‘𝑠))
39		prcdnql 7852	. . . . . . . . . . 11 ⊢ ((⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P ∧ 𝑟 ∈ (1st ‘𝑠)) → (𝑞 <Q 𝑟 → 𝑞 ∈ (1st ‘𝑠)))
40	37, 38, 39	syl2anc 415	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → (𝑞 <Q 𝑟 → 𝑞 ∈ (1st ‘𝑠)))
41	34, 40	mpd 13	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝑞 ∈ (1st ‘𝑠))
42		19.8a 1643	. . . . . . . . 9 ⊢ ((𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠)) → ∃𝑠(𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠)))
43	33, 41, 42	syl2anc 415	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → ∃𝑠(𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠)))
44		df-rex 2534	. . . . . . . 8 ⊢ (∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠) ↔ ∃𝑠(𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠)))
45	43, 44	sylibr 134	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
46	45, 1	sylibr 134	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑟 ∈ (1st ‘𝑠))) → 𝑞 ∈ ∪ (1st “ 𝐴))
47	32, 46	rexlimddv 2673	. . . . 5 ⊢ (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))) → 𝑞 ∈ ∪ (1st “ 𝐴))
48	47	ex 115	. . . 4 ⊢ ((𝜑 ∧ 𝑞 ∈ Q) → ((𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴)) → 𝑞 ∈ ∪ (1st “ 𝐴)))
49	48	rexlimdvw 2672	. . 3 ⊢ ((𝜑 ∧ 𝑞 ∈ Q) → (∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴)) → 𝑞 ∈ ∪ (1st “ 𝐴)))
50	30, 49	impbid 129	. 2 ⊢ ((𝜑 ∧ 𝑞 ∈ Q) → (𝑞 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))))
51	50	ralrimiva 2623	1 ⊢ (𝜑 → ∀𝑞 ∈ Q (𝑞 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ ∪ (1st “ 𝐴))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529   ⊆ wss 3220  ⟨cop 3712  ∪ cuni 3935   class class class wbr 4130   “ cima 4777  ‘cfv 5377  1^st c1st 6372  2^nd c2nd 6373  Qcnq 7648   <_Q cltq 7653  Pcnp 7659  <_P cltp 7663

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-qs 6813  df-ni 7672  df-nqqs 7716  df-ltnqqs 7721  df-inp 7834  df-iltp 7838

This theorem is used by:  suplocexprlemex  8090