genpelvl - Intuitionistic Logic Explorer

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

Theorem genpelvl 7572

Description: Membership in lower cut of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingdon, 2-Oct-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)

**Assertion**
Ref	Expression
genpelvl	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ)))

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

Proof of Theorem genpelvl Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		genpelvl.1	. . . . . . 7 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2		genpelvl.2	. . . . . . 7 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
3	1, 2	genipv 7569	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = ⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}⟩)
4	3	fveq2d 5558	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (1^st ‘(𝐴𝐹𝐵)) = (1^st ‘⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}⟩))
5		nqex 7423	. . . . . . 7 ⊢ Q ∈ V
6	5	rabex 4173	. . . . . 6 ⊢ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)} ∈ V
7	5	rabex 4173	. . . . . 6 ⊢ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)} ∈ V
8	6, 7	op1st 6199	. . . . 5 ⊢ (1^st ‘⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2^nd ‘𝐴)∃ℎ ∈ (2^nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}⟩) = {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}
9	4, 8	eqtrdi 2242	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (1^st ‘(𝐴𝐹𝐵)) = {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)})
10	9	eleq2d 2263	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ 𝐶 ∈ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}))
11		elrabi 2913	. . 3 ⊢ (𝐶 ∈ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)} → 𝐶 ∈ Q)
12	10, 11	biimtrdi 163	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (1^st ‘(𝐴𝐹𝐵)) → 𝐶 ∈ Q))
13		prop 7535	. . . . . . 7 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
14		elprnql 7541	. . . . . . 7 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑔 ∈ (1^st ‘𝐴)) → 𝑔 ∈ Q)
15	13, 14	sylan 283	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐴)) → 𝑔 ∈ Q)
16		prop 7535	. . . . . . 7 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
17		elprnql 7541	. . . . . . 7 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ ℎ ∈ (1^st ‘𝐵)) → ℎ ∈ Q)
18	16, 17	sylan 283	. . . . . 6 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ (1^st ‘𝐵)) → ℎ ∈ Q)
19	2	caovcl 6073	. . . . . 6 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔𝐺ℎ) ∈ Q)
20	15, 18, 19	syl2an 289	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (1^st ‘𝐵))) → (𝑔𝐺ℎ) ∈ Q)
21	20	an4s 588	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ (1^st ‘𝐴) ∧ ℎ ∈ (1^st ‘𝐵))) → (𝑔𝐺ℎ) ∈ Q)
22		eleq1 2256	. . . 4 ⊢ (𝐶 = (𝑔𝐺ℎ) → (𝐶 ∈ Q ↔ (𝑔𝐺ℎ) ∈ Q))
23	21, 22	syl5ibrcom 157	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ (1^st ‘𝐴) ∧ ℎ ∈ (1^st ‘𝐵))) → (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ Q))
24	23	rexlimdvva 2619	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ Q))
25		eqeq1 2200	. . . . . 6 ⊢ (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ)))
26	25	2rexbidv 2519	. . . . 5 ⊢ (𝑓 = 𝐶 → (∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ) ↔ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ)))
27	26	elrab3 2917	. . . 4 ⊢ (𝐶 ∈ Q → (𝐶 ∈ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝑓 = (𝑔𝐺ℎ)} ↔ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ)))
28	10, 27	sylan9bb 462	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐶 ∈ Q) → (𝐶 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ)))
29	28	ex 115	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ Q → (𝐶 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ))))
30	12, 24, 29	pm5.21ndd 706	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (1^st ‘𝐴)∃ℎ ∈ (1^st ‘𝐵)𝐶 = (𝑔𝐺ℎ)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ∃wrex 2473 {crab 2476 ⟨cop 3621 ‘cfv 5254 (class class class)co 5918 ∈ cmpo 5920 1^st c1st 6191 2^nd c2nd 6192 Qcnq 7340 Pcnp 7351

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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620

This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-qs 6593 df-ni 7364 df-nqqs 7408 df-inp 7526

This theorem is referenced by: genpprecll 7574 genpcdl 7579 genprndl 7581 genpdisj 7583 genpassl 7584 addnqprlemrl 7617 mulnqprlemrl 7633 distrlem1prl 7642 distrlem5prl 7646 1idprl 7650 ltexprlemfl 7669 recexprlem1ssl 7693 recexprlemss1l 7695 cauappcvgprlemladdfl 7715

W3C validator