genpcuu - Intuitionistic Logic Explorer

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

Theorem genpcuu 7519

Description: Upward closure of an operation on positive reals. (Contributed by Jim Kingdon, 8-Nov-2019.)

**Hypotheses**
Ref	Expression
genpelvl.1	⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2	⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
genpcuu.2	⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ (2^nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (2^nd ‘𝐵))) ∧ 𝑥 ∈ Q) → ((𝑔𝐺ℎ) <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))

**Assertion**
Ref	Expression
genpcuu	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵)))))

Distinct variable groups: 𝑥,𝑦,𝑧,𝑓,𝑔,ℎ,𝑤,𝑣,𝐴 𝑥,𝐵,𝑦,𝑧,𝑓,𝑔,ℎ,𝑤,𝑣 𝑥,𝐺,𝑦,𝑧,𝑓,𝑔,ℎ,𝑤,𝑣 𝑓,𝐹,𝑔,ℎ Allowed substitution hints: 𝐹(𝑥,𝑦,𝑧,𝑤,𝑣)

**Proof of Theorem genpcuu**
Step	Hyp	Ref	Expression
1		ltrelnq 7364	. . . . . . 7 ⊢ <_Q ⊆ (Q × Q)
2	1	brel 4679	. . . . . 6 ⊢ (𝑓 <_Q 𝑥 → (𝑓 ∈ Q ∧ 𝑥 ∈ Q))
3	2	simprd 114	. . . . 5 ⊢ (𝑓 <_Q 𝑥 → 𝑥 ∈ Q)
4		genpelvl.1	. . . . . . . . 9 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
5		genpelvl.2	. . . . . . . . 9 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
6	4, 5	genpelvu 7512	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)))
7	6	adantr 276	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑥 ∈ Q) → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)))
8		breq1 4007	. . . . . . . . . . . . 13 ⊢ (𝑓 = (𝑔𝐺ℎ) → (𝑓 <_Q 𝑥 ↔ (𝑔𝐺ℎ) <_Q 𝑥))
9	8	biimpd 144	. . . . . . . . . . . 12 ⊢ (𝑓 = (𝑔𝐺ℎ) → (𝑓 <_Q 𝑥 → (𝑔𝐺ℎ) <_Q 𝑥))
10		genpcuu.2	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ (2^nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (2^nd ‘𝐵))) ∧ 𝑥 ∈ Q) → ((𝑔𝐺ℎ) <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))
11	9, 10	sylan9r 410	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ P ∧ 𝑔 ∈ (2^nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (2^nd ‘𝐵))) ∧ 𝑥 ∈ Q) ∧ 𝑓 = (𝑔𝐺ℎ)) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))
12	11	exp31 364	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ (2^nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (2^nd ‘𝐵))) → (𝑥 ∈ Q → (𝑓 = (𝑔𝐺ℎ) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))))
13	12	an4s 588	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ (2^nd ‘𝐴) ∧ ℎ ∈ (2^nd ‘𝐵))) → (𝑥 ∈ Q → (𝑓 = (𝑔𝐺ℎ) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))))
14	13	impancom 260	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑥 ∈ Q) → ((𝑔 ∈ (2^nd ‘𝐴) ∧ ℎ ∈ (2^nd ‘𝐵)) → (𝑓 = (𝑔𝐺ℎ) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))))
15	14	rexlimdvv 2601	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑥 ∈ Q) → (∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵)))))
16	7, 15	sylbid 150	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑥 ∈ Q) → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵)))))
17	16	ex 115	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑥 ∈ Q → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))))
18	3, 17	syl5 32	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 <_Q 𝑥 → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))))
19	18	com34 83	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 <_Q 𝑥 → (𝑓 <_Q 𝑥 → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵))))))
20	19	pm2.43d 50	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 <_Q 𝑥 → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵)))))
21	20	com23 78	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 ∈ (2^nd ‘(𝐴𝐹𝐵)) → (𝑓 <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴𝐹𝐵)))))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ∃wrex 2456 {crab 2459 ⟨cop 3596 class class class wbr 4004 ‘cfv 5217 (class class class)co 5875 ∈ cmpo 5877 1^st c1st 6139 2^nd c2nd 6140 Qcnq 7279 <_Q cltq 7284 Pcnp 7290

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4119 ax-sep 4122 ax-pow 4175 ax-pr 4210 ax-un 4434 ax-setind 4537 ax-iinf 4588

This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2740 df-sbc 2964 df-csb 3059 df-dif 3132 df-un 3134 df-in 3136 df-ss 3143 df-pw 3578 df-sn 3599 df-pr 3600 df-op 3602 df-uni 3811 df-int 3846 df-iun 3889 df-br 4005 df-opab 4066 df-mpt 4067 df-id 4294 df-iom 4591 df-xp 4633 df-rel 4634 df-cnv 4635 df-co 4636 df-dm 4637 df-rn 4638 df-res 4639 df-ima 4640 df-iota 5179 df-fun 5219 df-fn 5220 df-f 5221 df-f1 5222 df-fo 5223 df-f1o 5224 df-fv 5225 df-ov 5878 df-oprab 5879 df-mpo 5880 df-1st 6141 df-2nd 6142 df-qs 6541 df-ni 7303 df-nqqs 7347 df-ltnqqs 7352 df-inp 7465

This theorem is referenced by: genprndu 7521

W3C validator