| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > suplocexprlem2b | GIF version | ||
| Description: Lemma for suplocexpr 8099. Expression for the lower cut of the putative supremum. (Contributed by Jim Kingdon, 9-Jan-2024.) |
| Ref | Expression |
|---|---|
| suplocexprlem2b.b | ⊢ 𝐵 = 〈∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}〉 |
| Ref | Expression |
|---|---|
| suplocexprlem2b | ⊢ (𝐴 ⊆ P → (2nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | suplocexprlem2b.b | . . 3 ⊢ 𝐵 = 〈∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}〉 | |
| 2 | 1 | fveq2i 5701 | . 2 ⊢ (2nd ‘𝐵) = (2nd ‘〈∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}〉) |
| 3 | fo1st 6395 | . . . . . 6 ⊢ 1st :V–onto→V | |
| 4 | fofun 5619 | . . . . . 6 ⊢ (1st :V–onto→V → Fun 1st ) | |
| 5 | 3, 4 | ax-mp 5 | . . . . 5 ⊢ Fun 1st |
| 6 | npex 7847 | . . . . . 6 ⊢ P ∈ V | |
| 7 | 6 | ssex 4272 | . . . . 5 ⊢ (𝐴 ⊆ P → 𝐴 ∈ V) |
| 8 | funimaexg 5468 | . . . . 5 ⊢ ((Fun 1st ∧ 𝐴 ∈ V) → (1st “ 𝐴) ∈ V) | |
| 9 | 5, 7, 8 | sylancr 418 | . . . 4 ⊢ (𝐴 ⊆ P → (1st “ 𝐴) ∈ V) |
| 10 | uniexg 4587 | . . . 4 ⊢ ((1st “ 𝐴) ∈ V → ∪ (1st “ 𝐴) ∈ V) | |
| 11 | 9, 10 | syl 14 | . . 3 ⊢ (𝐴 ⊆ P → ∪ (1st “ 𝐴) ∈ V) |
| 12 | nqex 7737 | . . . 4 ⊢ Q ∈ V | |
| 13 | 12 | rabex 4282 | . . 3 ⊢ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢} ∈ V |
| 14 | op2ndg 6389 | . . 3 ⊢ ((∪ (1st “ 𝐴) ∈ V ∧ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢} ∈ V) → (2nd ‘〈∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}〉) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}) | |
| 15 | 11, 13, 14 | sylancl 417 | . 2 ⊢ (𝐴 ⊆ P → (2nd ‘〈∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}〉) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}) |
| 16 | 2, 15 | eqtrid 2283 | 1 ⊢ (𝐴 ⊆ P → (2nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 {crab 2532 Vcvv 2821 ⊆ wss 3220 〈cop 3712 ∪ cuni 3935 ∩ cint 3970 class class class wbr 4131 “ cima 4779 Fun wfun 5374 –onto→wfo 5378 ‘cfv 5380 1st c1st 6376 2nd c2nd 6377 Qcnq 7654 <Q cltq 7659 Pcnp 7665 |
| 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 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-iinf 4737 |
| 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 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-1st 6378 df-2nd 6379 df-qs 6817 df-ni 7678 df-nqqs 7722 df-inp 7840 |
| This theorem is used by: suplocexprlemmu 8092 suplocexprlemru 8093 suplocexprlemdisj 8094 suplocexprlemloc 8095 suplocexprlemex 8096 suplocexprlemub 8097 |
| Copyright terms: Public domain | W3C validator |