genpelxp - Intuitionistic Logic Explorer

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

Theorem genpelxp 7879

Description: Set containing the result of adding or multiplying positive reals. (Contributed by Jim Kingdon, 5-Dec-2019.)

**Hypothesis**
Ref	Expression
genpelvl.1	⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)

**Assertion**
Ref	Expression
genpelxp	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) ∈ (𝒫 Q × 𝒫 Q))

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

**Proof of Theorem genpelxp**
Step	Hyp	Ref	Expression
1		ssrab2 3333	. . . . 5 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q
2		nqex 7731	. . . . . 6 ⊢ Q ∈ V
3	2	elpw2 4293	. . . . 5 ⊢ ({𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q ↔ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q)
4	1, 3	mpbir 146	. . . 4 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q
5		ssrab2 3333	. . . . 5 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q
6	2	elpw2 4293	. . . . 5 ⊢ ({𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q ↔ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q)
7	5, 6	mpbir 146	. . . 4 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q
8		opelxpi 4806	. . . 4 ⊢ (({𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q ∧ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q) → ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩ ∈ (𝒫 Q × 𝒫 Q))
9	4, 7, 8	mp2an 430	. . 3 ⊢ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩ ∈ (𝒫 Q × 𝒫 Q)
10		fveq2 5695	. . . . . . . . 9 ⊢ (𝑤 = 𝐴 → (1^st ‘𝑤) = (1^st ‘𝐴))
11	10	eleq2d 2308	. . . . . . . 8 ⊢ (𝑤 = 𝐴 → (𝑦 ∈ (1^st ‘𝑤) ↔ 𝑦 ∈ (1^st ‘𝐴)))
12	11	3anbi1d 1357	. . . . . . 7 ⊢ (𝑤 = 𝐴 → ((𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
13	12	2rexbidv 2575	. . . . . 6 ⊢ (𝑤 = 𝐴 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
14	13	rabbidv 2810	. . . . 5 ⊢ (𝑤 = 𝐴 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))})
15		fveq2 5695	. . . . . . . . 9 ⊢ (𝑤 = 𝐴 → (2^nd ‘𝑤) = (2^nd ‘𝐴))
16	15	eleq2d 2308	. . . . . . . 8 ⊢ (𝑤 = 𝐴 → (𝑦 ∈ (2^nd ‘𝑤) ↔ 𝑦 ∈ (2^nd ‘𝐴)))
17	16	3anbi1d 1357	. . . . . . 7 ⊢ (𝑤 = 𝐴 → ((𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
18	17	2rexbidv 2575	. . . . . 6 ⊢ (𝑤 = 𝐴 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
19	18	rabbidv 2810	. . . . 5 ⊢ (𝑤 = 𝐴 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))})
20	14, 19	opeq12d 3912	. . . 4 ⊢ (𝑤 = 𝐴 → ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩ = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
21		fveq2 5695	. . . . . . . . 9 ⊢ (𝑣 = 𝐵 → (1^st ‘𝑣) = (1^st ‘𝐵))
22	21	eleq2d 2308	. . . . . . . 8 ⊢ (𝑣 = 𝐵 → (𝑧 ∈ (1^st ‘𝑣) ↔ 𝑧 ∈ (1^st ‘𝐵)))
23	22	3anbi2d 1358	. . . . . . 7 ⊢ (𝑣 = 𝐵 → ((𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
24	23	2rexbidv 2575	. . . . . 6 ⊢ (𝑣 = 𝐵 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
25	24	rabbidv 2810	. . . . 5 ⊢ (𝑣 = 𝐵 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))})
26		fveq2 5695	. . . . . . . . 9 ⊢ (𝑣 = 𝐵 → (2^nd ‘𝑣) = (2^nd ‘𝐵))
27	26	eleq2d 2308	. . . . . . . 8 ⊢ (𝑣 = 𝐵 → (𝑧 ∈ (2^nd ‘𝑣) ↔ 𝑧 ∈ (2^nd ‘𝐵)))
28	27	3anbi2d 1358	. . . . . . 7 ⊢ (𝑣 = 𝐵 → ((𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
29	28	2rexbidv 2575	. . . . . 6 ⊢ (𝑣 = 𝐵 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
30	29	rabbidv 2810	. . . . 5 ⊢ (𝑣 = 𝐵 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))})
31	25, 30	opeq12d 3912	. . . 4 ⊢ (𝑣 = 𝐵 → ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩ = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
32		genpelvl.1	. . . 4 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
33	20, 31, 32	ovmpog 6223	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩ ∈ (𝒫 Q × 𝒫 Q)) → (𝐴𝐹𝐵) = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
34	9, 33	mp3an3 1367	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
35	34, 9	eqeltrdi 2329	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) ∈ (𝒫 Q × 𝒫 Q))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 {crab 2532 ⊆ wss 3220 𝒫 cpw 3688 ⟨cop 3712 × cxp 4772 ‘cfv 5377 (class class class)co 6085 ∈ cmpo 6087 1^st c1st 6372 2^nd c2nd 6373 Qcnq 7648 Pcnp 7659

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-setind 4684 ax-iinf 4735

This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 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-ne 2421 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-ov 6088 df-oprab 6089 df-mpo 6090 df-qs 6813 df-ni 7672 df-nqqs 7716

This theorem is used by: addclpr 7905 mulclpr 7940

W3C validator