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

Theorem suplocexprlemdisj 8088
Description: Lemma for suplocexpr 8093. The putative supremum is disjoint. (Contributed by Jim Kingdon, 9-Jan-2024.)
Hypotheses
Ref Expression
suplocexpr.m (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
suplocexpr.ub (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
suplocexpr.loc (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
suplocexpr.b 𝐵 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩
Assertion
Ref Expression
suplocexprlemdisj (𝜑 → ∀𝑞 ∈ Q ¬ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵)))
Distinct variable groups:   𝑤,𝐴,𝑢   𝑥,𝐴,𝑦   𝑤,𝐵   𝜑,𝑞,𝑤   𝜑,𝑥,𝑦   𝑢,𝑞
Allowed substitution hints:   𝜑(𝑧, 𝑢)   𝐴(𝑧, 𝑞)   𝐵(𝑥, 𝑦, 𝑧, 𝑢, 𝑞)

Proof of Theorem suplocexprlemdisj
Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprl 535 . . . . 5 (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) → 𝑞 ∈ ∪ (1st “ 𝐴))
2 suplocexprlemell 8081 . . . . 5 (𝑞 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
31, 2sylib 122 . . . 4 (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) → ∃𝑠 ∈ 𝐴 𝑞 ∈ (1st ‘𝑠))
4 simprr 537 . . . . . 6 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (1st ‘𝑠))
5 simplrr 542 . . . . . . . . 9 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (2nd ‘𝐵))
6 suplocexpr.m . . . . . . . . . . . . 13 (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
7 suplocexpr.ub . . . . . . . . . . . . 13 (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
8 suplocexpr.loc . . . . . . . . . . . . 13 (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
96, 7, 8suplocexprlemss 8083 . . . . . . . . . . . 12 (𝜑 → 𝐴 ⊆ P)
109ad3antrrr 496 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝐴 ⊆ P)
11 suplocexpr.b . . . . . . . . . . . . 13 𝐵 = ⟨∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}⟩
1211suplocexprlem2b 8082 . . . . . . . . . . . 12 (𝐴 ⊆ P → (2nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢})
1312eleq2d 2308 . . . . . . . . . . 11 (𝐴 ⊆ P → (𝑞 ∈ (2nd ‘𝐵) ↔ 𝑞 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}))
1410, 13syl 14 . . . . . . . . . 10 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ (2nd ‘𝐵) ↔ 𝑞 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}))
15 breq2 4134 . . . . . . . . . . . 12 (𝑢 = 𝑞 → (𝑤 <Q 𝑢 ↔ 𝑤 <Q 𝑞))
1615rexbidv 2551 . . . . . . . . . . 11 (𝑢 = 𝑞 → (∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢 ↔ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞))
1716elrab 2982 . . . . . . . . . 10 (𝑞 ∈ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢} ↔ (𝑞 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞))
1814, 17bitrdi 196 . . . . . . . . 9 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ (2nd ‘𝐵) ↔ (𝑞 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞)))
195, 18mpbid 147 . . . . . . . 8 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ Q ∧ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞))
2019simprd 114 . . . . . . 7 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑞)
21 simprr 537 . . . . . . . 8 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑤 <Q 𝑞)
2210adantr 276 . . . . . . . . . . 11 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝐴 ⊆ P)
23 simplrl 541 . . . . . . . . . . 11 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑠 ∈ 𝐴)
2422, 23sseldd 3249 . . . . . . . . . 10 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑠 ∈ P)
25 prop 7843 . . . . . . . . . 10 (𝑠 ∈ P → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
2624, 25syl 14 . . . . . . . . 9 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
27 eleq2 2302 . . . . . . . . . 10 (𝑡 = (2nd ‘𝑠) → (𝑤 ∈ 𝑡 ↔ 𝑤 ∈ (2nd ‘𝑠)))
28 simprl 535 . . . . . . . . . . 11 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑤 ∈ ∩ (2nd “ 𝐴))
29 vex 2824 . . . . . . . . . . . 12 𝑤 ∈ V
3029elint2 3977 . . . . . . . . . . 11 (𝑤 ∈ ∩ (2nd “ 𝐴) ↔ ∀𝑡 ∈ (2nd “ 𝐴)𝑤 ∈ 𝑡)
3128, 30sylib 122 . . . . . . . . . 10 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → ∀𝑡 ∈ (2nd “ 𝐴)𝑤 ∈ 𝑡)
32 fo2nd 6392 . . . . . . . . . . . . . 14 2nd :V–onto→V
33 fofun 5616 . . . . . . . . . . . . . 14 (2nd :V–onto→V → Fun 2nd )
3432, 33ax-mp 5 . . . . . . . . . . . . 13 Fun 2nd
35 vex 2824 . . . . . . . . . . . . . 14 𝑠 ∈ V
36 fof 5615 . . . . . . . . . . . . . . . 16 (2nd :V–onto→V → 2nd :V⟶V)
3732, 36ax-mp 5 . . . . . . . . . . . . . . 15 2nd :V⟶V
3837fdmi 5541 . . . . . . . . . . . . . 14 dom 2nd = V
3935, 38eleqtrri 2314 . . . . . . . . . . . . 13 𝑠 ∈ dom 2nd
40 funfvima 5950 . . . . . . . . . . . . 13 ((Fun 2nd ∧ 𝑠 ∈ dom 2nd ) → (𝑠 ∈ 𝐴 → (2nd ‘𝑠) ∈ (2nd “ 𝐴)))
4134, 39, 40mp2an 430 . . . . . . . . . . . 12 (𝑠 ∈ 𝐴 → (2nd ‘𝑠) ∈ (2nd “ 𝐴))
4241ad2antrl 494 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (2nd ‘𝑠) ∈ (2nd “ 𝐴))
4342adantr 276 . . . . . . . . . 10 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → (2nd ‘𝑠) ∈ (2nd “ 𝐴))
4427, 31, 43rspcdva 2934 . . . . . . . . 9 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑤 ∈ (2nd ‘𝑠))
45 prcunqu 7853 . . . . . . . . 9 ((⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P ∧ 𝑤 ∈ (2nd ‘𝑠)) → (𝑤 <Q 𝑞 → 𝑞 ∈ (2nd ‘𝑠)))
4626, 44, 45syl2anc 415 . . . . . . . 8 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → (𝑤 <Q 𝑞 → 𝑞 ∈ (2nd ‘𝑠)))
4721, 46mpd 13 . . . . . . 7 (((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) ∧ (𝑤 ∈ ∩ (2nd “ 𝐴) ∧ 𝑤 <Q 𝑞)) → 𝑞 ∈ (2nd ‘𝑠))
4820, 47rexlimddv 2673 . . . . . 6 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ (2nd ‘𝑠))
494, 48jca 306 . . . . 5 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → (𝑞 ∈ (1st ‘𝑠) ∧ 𝑞 ∈ (2nd ‘𝑠)))
50 simprl 535 . . . . . . . 8 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑠 ∈ 𝐴)
5110, 50sseldd 3249 . . . . . . 7 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑠 ∈ P)
5251, 25syl 14 . . . . . 6 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P)
53 simpllr 540 . . . . . 6 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → 𝑞 ∈ Q)
54 prdisj 7860 . . . . . 6 ((⟨(1st ‘𝑠), (2nd ‘𝑠)⟩ ∈ P ∧ 𝑞 ∈ Q) → ¬ (𝑞 ∈ (1st ‘𝑠) ∧ 𝑞 ∈ (2nd ‘𝑠)))
5552, 53, 54syl2anc 415 . . . . 5 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ¬ (𝑞 ∈ (1st ‘𝑠) ∧ 𝑞 ∈ (2nd ‘𝑠)))
5649, 55pm2.21fal 1422 . . . 4 ((((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) ∧ (𝑠 ∈ 𝐴 ∧ 𝑞 ∈ (1st ‘𝑠))) → ⊥)
573, 56rexlimddv 2673 . . 3 (((𝜑 ∧ 𝑞 ∈ Q) ∧ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵))) → ⊥)
5857inegd 1421 . 2 ((𝜑 ∧ 𝑞 ∈ Q) → ¬ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵)))
5958ralrimiva 2623 1 (𝜑 → ∀𝑞 ∈ Q ¬ (𝑞 ∈ ∪ (1st “ 𝐴) ∧ 𝑞 ∈ (2nd ‘𝐵)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   = wceq 1402  ⊥wfal 1407  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  {crab 2532  Vcvv 2821   ⊆ wss 3220  ⟨cop 3712  ∪ cuni 3935  ∩ cint 3970   class class class wbr 4130  dom cdm 4774   “ cima 4777  Fun wfun 5371  ⟶wf 5373  –onto→wfo 5375  ‘cfv 5377  1st c1st 6372  2nd 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-fal 1408  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
  Copyright terms: Public domain W3C validator