| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > suplocexprlemml | GIF version | ||
| Description: Lemma for suplocexpr 7988. The lower cut of the putative supremum is inhabited. (Contributed by Jim Kingdon, 7-Jan-2024.) |
| Ref | Expression |
|---|---|
| suplocexpr.m | ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴) |
| suplocexpr.ub | ⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) |
| suplocexpr.loc | ⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦))) |
| Ref | Expression |
|---|---|
| suplocexprlemml | ⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | suplocexpr.m | . . 3 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | suplocexpr.ub | . . . . . . 7 ⊢ (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) | |
| 3 | suplocexpr.loc | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦))) | |
| 4 | 1, 2, 3 | suplocexprlemss 7978 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ P) |
| 5 | 4 | sselda 3228 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ P) |
| 6 | prop 7738 | . . . . 5 ⊢ (𝑥 ∈ P → 〈(1st ‘𝑥), (2nd ‘𝑥)〉 ∈ P) | |
| 7 | prml 7740 | . . . . 5 ⊢ (〈(1st ‘𝑥), (2nd ‘𝑥)〉 ∈ P → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) | |
| 8 | 5, 6, 7 | 3syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) |
| 9 | 8 | ralrimiva 2606 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) |
| 10 | r19.2m 3583 | . . 3 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) → ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) | |
| 11 | 1, 9, 10 | syl2anc 411 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) |
| 12 | suplocexprlemell 7976 | . . . 4 ⊢ (𝑠 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑠 ∈ (1st ‘𝑥)) | |
| 13 | 12 | rexbii 2540 | . . 3 ⊢ (∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑠 ∈ Q ∃𝑥 ∈ 𝐴 𝑠 ∈ (1st ‘𝑥)) |
| 14 | rexcom 2698 | . . 3 ⊢ (∃𝑠 ∈ Q ∃𝑥 ∈ 𝐴 𝑠 ∈ (1st ‘𝑥) ↔ ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) | |
| 15 | 13, 14 | bitri 184 | . 2 ⊢ (∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) |
| 16 | 11, 15 | sylibr 134 | 1 ⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 716 ∃wex 1541 ∈ wcel 2202 ∀wral 2511 ∃wrex 2512 〈cop 3676 ∪ cuni 3898 class class class wbr 4093 “ cima 4734 ‘cfv 5333 1st c1st 6310 2nd c2nd 6311 Qcnq 7543 Pcnp 7554 <P cltp 7558 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-1st 6312 df-2nd 6313 df-qs 6751 df-ni 7567 df-nqqs 7611 df-inp 7729 df-iltp 7733 |
| This theorem is referenced by: suplocexprlemex 7985 |
| Copyright terms: Public domain | W3C validator |