genpcuu - Intuitionistic Logic Explorer

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

Theorem genpcuu 7587

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 7432	. . . . . . 7 ⊢ <_Q ⊆ (Q × Q)
2	1	brel 4715	. . . . . 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 7580	. . . . . . . 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 4036	. . . . . . . . . . . . 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 2621	. . . . . . 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 980 = wceq 1364 ∈ wcel 2167 ∃wrex 2476 {crab 2479 ⟨cop 3625 class class class wbr 4033 ‘cfv 5258 (class class class)co 5922 ∈ cmpo 5924 1^st c1st 6196 2^nd c2nd 6197 Qcnq 7347 <_Q cltq 7352 Pcnp 7358

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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4148 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-iinf 4624

This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-br 4034 df-opab 4095 df-mpt 4096 df-id 4328 df-iom 4627 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-f1 5263 df-fo 5264 df-f1o 5265 df-fv 5266 df-ov 5925 df-oprab 5926 df-mpo 5927 df-1st 6198 df-2nd 6199 df-qs 6598 df-ni 7371 df-nqqs 7415 df-ltnqqs 7420 df-inp 7533

This theorem is referenced by: genprndu 7589

W3C validator