| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > suplocexprlem2b | GIF version | ||
| Description: Lemma for suplocexpr 8092. 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 5698 | . 2 ⊢ (2nd ‘𝐵) = (2nd ‘〈∪ (1st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢}〉) |
| 3 | fo1st 6391 | . . . . . 6 ⊢ 1st :V–onto→V | |
| 4 | fofun 5616 | . . . . . 6 ⊢ (1st :V–onto→V → Fun 1st ) | |
| 5 | 3, 4 | ax-mp 5 | . . . . 5 ⊢ Fun 1st |
| 6 | npex 7840 | . . . . . 6 ⊢ P ∈ V | |
| 7 | 6 | ssex 4270 | . . . . 5 ⊢ (𝐴 ⊆ P → 𝐴 ∈ V) |
| 8 | funimaexg 5465 | . . . . 5 ⊢ ((Fun 1st ∧ 𝐴 ∈ V) → (1st “ 𝐴) ∈ V) | |
| 9 | 5, 7, 8 | sylancr 418 | . . . 4 ⊢ (𝐴 ⊆ P → (1st “ 𝐴) ∈ V) |
| 10 | uniexg 4585 | . . . 4 ⊢ ((1st “ 𝐴) ∈ V → ∪ (1st “ 𝐴) ∈ V) | |
| 11 | 9, 10 | syl 14 | . . 3 ⊢ (𝐴 ⊆ P → ∪ (1st “ 𝐴) ∈ V) |
| 12 | nqex 7730 | . . . 4 ⊢ Q ∈ V | |
| 13 | 12 | rabex 4280 | . . 3 ⊢ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2nd “ 𝐴)𝑤 <Q 𝑢} ∈ V |
| 14 | op2ndg 6385 | . . 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 4130 “ cima 4777 Fun wfun 5371 –onto→wfo 5375 ‘cfv 5377 1st c1st 6372 2nd c2nd 6373 Qcnq 7647 <Q cltq 7652 Pcnp 7658 |
| 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 7671 df-nqqs 7715 df-inp 7833 |
| This theorem is used by: suplocexprlemmu 8085 suplocexprlemru 8086 suplocexprlemdisj 8087 suplocexprlemloc 8088 suplocexprlemex 8089 suplocexprlemub 8090 |
| Copyright terms: Public domain | W3C validator |