genpelxp - Intuitionistic Logic Explorer

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

Theorem genpelxp 6609

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 3025	. . . . 5 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q
2		nqex 6461	. . . . . 6 ⊢ Q ∈ V
3	2	elpw2 3911	. . . . 5 ⊢ ({𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q ↔ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q)
4	1, 3	mpbir 134	. . . 4 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q
5		ssrab2 3025	. . . . 5 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q
6	2	elpw2 3911	. . . . 5 ⊢ ({𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q ↔ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ⊆ Q)
7	5, 6	mpbir 134	. . . 4 ⊢ {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))} ∈ 𝒫 Q
8		opelxpi 4376	. . . 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 402	. . 3 ⊢ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩ ∈ (𝒫 Q × 𝒫 Q)
10		fveq2 5178	. . . . . . . . 9 ⊢ (𝑤 = 𝐴 → (1^st ‘𝑤) = (1^st ‘𝐴))
11	10	eleq2d 2107	. . . . . . . 8 ⊢ (𝑤 = 𝐴 → (𝑦 ∈ (1^st ‘𝑤) ↔ 𝑦 ∈ (1^st ‘𝐴)))
12	11	3anbi1d 1211	. . . . . . 7 ⊢ (𝑤 = 𝐴 → ((𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
13	12	2rexbidv 2349	. . . . . 6 ⊢ (𝑤 = 𝐴 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
14	13	rabbidv 2549	. . . . 5 ⊢ (𝑤 = 𝐴 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))})
15		fveq2 5178	. . . . . . . . 9 ⊢ (𝑤 = 𝐴 → (2^nd ‘𝑤) = (2^nd ‘𝐴))
16	15	eleq2d 2107	. . . . . . . 8 ⊢ (𝑤 = 𝐴 → (𝑦 ∈ (2^nd ‘𝑤) ↔ 𝑦 ∈ (2^nd ‘𝐴)))
17	16	3anbi1d 1211	. . . . . . 7 ⊢ (𝑤 = 𝐴 → ((𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
18	17	2rexbidv 2349	. . . . . 6 ⊢ (𝑤 = 𝐴 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))))
19	18	rabbidv 2549	. . . . 5 ⊢ (𝑤 = 𝐴 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))})
20	14, 19	opeq12d 3557	. . . 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 5178	. . . . . . . . 9 ⊢ (𝑣 = 𝐵 → (1^st ‘𝑣) = (1^st ‘𝐵))
22	21	eleq2d 2107	. . . . . . . 8 ⊢ (𝑣 = 𝐵 → (𝑧 ∈ (1^st ‘𝑣) ↔ 𝑧 ∈ (1^st ‘𝐵)))
23	22	3anbi2d 1212	. . . . . . 7 ⊢ (𝑣 = 𝐵 → ((𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
24	23	2rexbidv 2349	. . . . . 6 ⊢ (𝑣 = 𝐵 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
25	24	rabbidv 2549	. . . . 5 ⊢ (𝑣 = 𝐵 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))})
26		fveq2 5178	. . . . . . . . 9 ⊢ (𝑣 = 𝐵 → (2^nd ‘𝑣) = (2^nd ‘𝐵))
27	26	eleq2d 2107	. . . . . . . 8 ⊢ (𝑣 = 𝐵 → (𝑧 ∈ (2^nd ‘𝑣) ↔ 𝑧 ∈ (2^nd ‘𝐵)))
28	27	3anbi2d 1212	. . . . . . 7 ⊢ (𝑣 = 𝐵 → ((𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
29	28	2rexbidv 2349	. . . . . 6 ⊢ (𝑣 = 𝐵 → (∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧)) ↔ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))))
30	29	rabbidv 2549	. . . . 5 ⊢ (𝑣 = 𝐵 → {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))})
31	25, 30	opeq12d 3557	. . . 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	ovmpt2g 5635	. . 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 1221	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝐴) ∧ 𝑧 ∈ (2^nd ‘𝐵) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
35	34, 9	syl6eqel 2128	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) ∈ (𝒫 Q × 𝒫 Q))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 97 ∧ w3a 885 = wceq 1243 ∈ wcel 1393 ∃wrex 2307 {crab 2310 ⊆ wss 2917 𝒫 cpw 3359 ⟨cop 3378 × cxp 4343 ‘cfv 4902 (class class class)co 5512 ↦ cmpt2 5514 1^st c1st 5765 2^nd c2nd 5766 Qcnq 6378 Pcnp 6389

This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311

This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-id 4030 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-qs 6112 df-ni 6402 df-nqqs 6446

This theorem is referenced by: addclpr 6635 mulclpr 6670

W3C validator