suplocexprlem2b - Intuitionistic Logic Explorer

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

Theorem suplocexprlem2b 7934

Description: Lemma for suplocexpr 7945. Expression for the lower cut of the putative supremum. (Contributed by Jim Kingdon, 9-Jan-2024.)

**Hypothesis**
Ref	Expression
suplocexprlem2b.b	⊢ 𝐵 = ⟨∪ (1^st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢}⟩

**Assertion**
Ref	Expression
suplocexprlem2b	⊢ (𝐴 ⊆ P → (2^nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢})

**Proof of Theorem suplocexprlem2b**
Step	Hyp	Ref	Expression
1		suplocexprlem2b.b	. . 3 ⊢ 𝐵 = ⟨∪ (1^st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢}⟩
2	1	fveq2i 5642	. 2 ⊢ (2^nd ‘𝐵) = (2^nd ‘⟨∪ (1^st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢}⟩)
3		fo1st 6320	. . . . . 6 ⊢ 1^st :V–onto→V
4		fofun 5560	. . . . . 6 ⊢ (1^st :V–onto→V → Fun 1^st )
5	3, 4	ax-mp 5	. . . . 5 ⊢ Fun 1^st
6		npex 7693	. . . . . 6 ⊢ P ∈ V
7	6	ssex 4226	. . . . 5 ⊢ (𝐴 ⊆ P → 𝐴 ∈ V)
8		funimaexg 5414	. . . . 5 ⊢ ((Fun 1^st ∧ 𝐴 ∈ V) → (1^st “ 𝐴) ∈ V)
9	5, 7, 8	sylancr 414	. . . 4 ⊢ (𝐴 ⊆ P → (1^st “ 𝐴) ∈ V)
10		uniexg 4536	. . . 4 ⊢ ((1^st “ 𝐴) ∈ V → ∪ (1^st “ 𝐴) ∈ V)
11	9, 10	syl 14	. . 3 ⊢ (𝐴 ⊆ P → ∪ (1^st “ 𝐴) ∈ V)
12		nqex 7583	. . . 4 ⊢ Q ∈ V
13	12	rabex 4234	. . 3 ⊢ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢} ∈ V
14		op2ndg 6314	. . 3 ⊢ ((∪ (1^st “ 𝐴) ∈ V ∧ {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢} ∈ V) → (2^nd ‘⟨∪ (1^st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢}⟩) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢})
15	11, 13, 14	sylancl 413	. 2 ⊢ (𝐴 ⊆ P → (2^nd ‘⟨∪ (1^st “ 𝐴), {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢}⟩) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢})
16	2, 15	eqtrid 2276	1 ⊢ (𝐴 ⊆ P → (2^nd ‘𝐵) = {𝑢 ∈ Q ∣ ∃𝑤 ∈ ∩ (2^nd “ 𝐴)𝑤 <_Q 𝑢})

Colors of variables: wff set class

Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 ∃wrex 2511 {crab 2514 Vcvv 2802 ⊆ wss 3200 ⟨cop 3672 ∪ cuni 3893 ∩ cint 3928 class class class wbr 4088 “ cima 4728 Fun wfun 5320 –onto→wfo 5324 ‘cfv 5326 1^st c1st 6301 2^nd c2nd 6302 Qcnq 7500 <_Q cltq 7505 Pcnp 7511

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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-iinf 4686

This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-1st 6303 df-2nd 6304 df-qs 6708 df-ni 7524 df-nqqs 7568 df-inp 7686

This theorem is referenced by: suplocexprlemmu 7938 suplocexprlemru 7939 suplocexprlemdisj 7940 suplocexprlemloc 7941 suplocexprlemex 7942 suplocexprlemub 7943

W3C validator