Theorem genpelvu 7844

Description: Membership in upper cut of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingdon, 15-Oct-2019.)

Hypotheses

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

Assertion

Ref	Expression
genpelvu	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑔,ℎ,𝑤,𝑣,𝐴   𝑥,𝐵,𝑦,𝑧,𝑔,ℎ,𝑤,𝑣   𝑥,𝐺,𝑦,𝑧,𝑔,ℎ,𝑤,𝑣   𝑔,𝐹   𝐶,𝑔,ℎ

Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧,𝑤,𝑣)   𝐹(𝑥,𝑦,𝑧,𝑤,𝑣,ℎ)

Proof of Theorem genpelvu

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		genpelvl.1	. . . . . . 7 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2		genpelvl.2	. . . . . . 7 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
3	1, 2	genipv 7840	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = ⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}⟩)
4	3	fveq2d 5679	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (2nd ‘(𝐴𝐹𝐵)) = (2nd ‘⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}⟩))
5		nqex 7694	. . . . . . 7 ⊢ Q ∈ V
6	5	rabex 4261	. . . . . 6 ⊢ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)𝑓 = (𝑔𝐺ℎ)} ∈ V
7	5	rabex 4261	. . . . . 6 ⊢ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)} ∈ V
8	6, 7	op2nd 6354	. . . . 5 ⊢ (2nd ‘⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)𝑓 = (𝑔𝐺ℎ)}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}⟩) = {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}
9	4, 8	eqtrdi 2283	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (2nd ‘(𝐴𝐹𝐵)) = {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)})
10	9	eleq2d 2304	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ 𝐶 ∈ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)}))
11		elrabi 2973	. . 3 ⊢ (𝐶 ∈ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)} → 𝐶 ∈ Q)
12	10, 11	biimtrdi 163	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) → 𝐶 ∈ Q))
13		prop 7806	. . . . . . 7 ⊢ (𝐴 ∈ P → ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P)
14		elprnqu 7813	. . . . . . 7 ⊢ ((⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∈ P ∧ 𝑔 ∈ (2nd ‘𝐴)) → 𝑔 ∈ Q)
15	13, 14	sylan 283	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ (2nd ‘𝐴)) → 𝑔 ∈ Q)
16		prop 7806	. . . . . . 7 ⊢ (𝐵 ∈ P → ⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P)
17		elprnqu 7813	. . . . . . 7 ⊢ ((⟨(1st ‘𝐵), (2nd ‘𝐵)⟩ ∈ P ∧ ℎ ∈ (2nd ‘𝐵)) → ℎ ∈ Q)
18	16, 17	sylan 283	. . . . . 6 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ (2nd ‘𝐵)) → ℎ ∈ Q)
19	2	caovcl 6217	. . . . . 6 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔𝐺ℎ) ∈ Q)
20	15, 18, 19	syl2an 289	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (2nd ‘𝐵))) → (𝑔𝐺ℎ) ∈ Q)
21	20	an4s 592	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ (2nd ‘𝐴) ∧ ℎ ∈ (2nd ‘𝐵))) → (𝑔𝐺ℎ) ∈ Q)
22		eleq1 2297	. . . 4 ⊢ (𝐶 = (𝑔𝐺ℎ) → (𝐶 ∈ Q ↔ (𝑔𝐺ℎ) ∈ Q))
23	21, 22	syl5ibrcom 157	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ (2nd ‘𝐴) ∧ ℎ ∈ (2nd ‘𝐵))) → (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ Q))
24	23	rexlimdvva 2670	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ Q))
25		eqeq1 2241	. . . . . 6 ⊢ (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ)))
26	25	2rexbidv 2569	. . . . 5 ⊢ (𝑓 = 𝐶 → (∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ) ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ)))
27	26	elrab3 2977	. . . 4 ⊢ (𝐶 ∈ Q → (𝐶 ∈ {𝑓 ∈ Q ∣ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝑓 = (𝑔𝐺ℎ)} ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ)))
28	10, 27	sylan9bb 462	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐶 ∈ Q) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ)))
29	28	ex 115	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ Q → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ))))
30	12, 24, 29	pm5.21ndd 713	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)𝐶 = (𝑔𝐺ℎ)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2205  ∃wrex 2523  {crab 2526  ⟨cop 3697  ‘cfv 5357  (class class class)co 6058   ∈ cmpo 6060  1^st c1st 6345  2^nd c2nd 6346  Qcnq 7611  Pcnp 7622

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-qs 6786  df-ni 7635  df-nqqs 7679  df-inp 7797

This theorem is referenced by:  genppreclu  7846  genpcuu  7851  genprndu  7853  genpdisj  7854  genpassu  7856  addnqprlemru  7889  mulnqprlemru  7905  distrlem1pru  7914  distrlem5pru  7918  1idpru  7922  ltexprlemfu  7942  recexprlem1ssu  7965  recexprlemss1u  7967  cauappcvgprlemladdfu  7985  caucvgprlemladdfu  8008