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

Theorem genpelvu 7072
 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.
StepHypRef Expression
1 genpelvl.1 . . . . . . 7 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2 genpelvl.2 . . . . . . 7 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
31, 2genipv 7068 . . . . . 6 ((𝐴P𝐵P) → (𝐴𝐹𝐵) = ⟨{𝑓Q ∣ ∃𝑔 ∈ (1st𝐴)∃ ∈ (1st𝐵)𝑓 = (𝑔𝐺)}, {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)}⟩)
43fveq2d 5309 . . . . 5 ((𝐴P𝐵P) → (2nd ‘(𝐴𝐹𝐵)) = (2nd ‘⟨{𝑓Q ∣ ∃𝑔 ∈ (1st𝐴)∃ ∈ (1st𝐵)𝑓 = (𝑔𝐺)}, {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)}⟩))
5 nqex 6922 . . . . . . 7 Q ∈ V
65rabex 3983 . . . . . 6 {𝑓Q ∣ ∃𝑔 ∈ (1st𝐴)∃ ∈ (1st𝐵)𝑓 = (𝑔𝐺)} ∈ V
75rabex 3983 . . . . . 6 {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)} ∈ V
86, 7op2nd 5918 . . . . 5 (2nd ‘⟨{𝑓Q ∣ ∃𝑔 ∈ (1st𝐴)∃ ∈ (1st𝐵)𝑓 = (𝑔𝐺)}, {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)}⟩) = {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)}
94, 8syl6eq 2136 . . . 4 ((𝐴P𝐵P) → (2nd ‘(𝐴𝐹𝐵)) = {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)})
109eleq2d 2157 . . 3 ((𝐴P𝐵P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ 𝐶 ∈ {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)}))
11 elrabi 2768 . . 3 (𝐶 ∈ {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)} → 𝐶Q)
1210, 11syl6bi 161 . 2 ((𝐴P𝐵P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) → 𝐶Q))
13 prop 7034 . . . . . . 7 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
14 elprnqu 7041 . . . . . . 7 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑔 ∈ (2nd𝐴)) → 𝑔Q)
1513, 14sylan 277 . . . . . 6 ((𝐴P𝑔 ∈ (2nd𝐴)) → 𝑔Q)
16 prop 7034 . . . . . . 7 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
17 elprnqu 7041 . . . . . . 7 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P ∈ (2nd𝐵)) → Q)
1816, 17sylan 277 . . . . . 6 ((𝐵P ∈ (2nd𝐵)) → Q)
192caovcl 5799 . . . . . 6 ((𝑔QQ) → (𝑔𝐺) ∈ Q)
2015, 18, 19syl2an 283 . . . . 5 (((𝐴P𝑔 ∈ (2nd𝐴)) ∧ (𝐵P ∈ (2nd𝐵))) → (𝑔𝐺) ∈ Q)
2120an4s 555 . . . 4 (((𝐴P𝐵P) ∧ (𝑔 ∈ (2nd𝐴) ∧ ∈ (2nd𝐵))) → (𝑔𝐺) ∈ Q)
22 eleq1 2150 . . . 4 (𝐶 = (𝑔𝐺) → (𝐶Q ↔ (𝑔𝐺) ∈ Q))
2321, 22syl5ibrcom 155 . . 3 (((𝐴P𝐵P) ∧ (𝑔 ∈ (2nd𝐴) ∧ ∈ (2nd𝐵))) → (𝐶 = (𝑔𝐺) → 𝐶Q))
2423rexlimdvva 2496 . 2 ((𝐴P𝐵P) → (∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝐶 = (𝑔𝐺) → 𝐶Q))
25 eqeq1 2094 . . . . . 6 (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺) ↔ 𝐶 = (𝑔𝐺)))
26252rexbidv 2403 . . . . 5 (𝑓 = 𝐶 → (∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺) ↔ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝐶 = (𝑔𝐺)))
2726elrab3 2772 . . . 4 (𝐶Q → (𝐶 ∈ {𝑓Q ∣ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝑓 = (𝑔𝐺)} ↔ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝐶 = (𝑔𝐺)))
2810, 27sylan9bb 450 . . 3 (((𝐴P𝐵P) ∧ 𝐶Q) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝐶 = (𝑔𝐺)))
2928ex 113 . 2 ((𝐴P𝐵P) → (𝐶Q → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝐶 = (𝑔𝐺))))
3012, 24, 29pm5.21ndd 656 1 ((𝐴P𝐵P) → (𝐶 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd𝐴)∃ ∈ (2nd𝐵)𝐶 = (𝑔𝐺)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 102   ↔ wb 103   ∧ w3a 924   = wceq 1289   ∈ wcel 1438  ∃wrex 2360  {crab 2363  ⟨cop 3449  ‘cfv 5015  (class class class)co 5652   ↦ cmpt2 5654  1st c1st 5909  2nd c2nd 5910  Qcnq 6839  Pcnp 6850 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3954  ax-sep 3957  ax-pow 4009  ax-pr 4036  ax-un 4260  ax-setind 4353  ax-iinf 4403 This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2841  df-csb 2934  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-int 3689  df-iun 3732  df-br 3846  df-opab 3900  df-mpt 3901  df-id 4120  df-iom 4406  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-f1 5020  df-fo 5021  df-f1o 5022  df-fv 5023  df-ov 5655  df-oprab 5656  df-mpt2 5657  df-1st 5911  df-2nd 5912  df-qs 6298  df-ni 6863  df-nqqs 6907  df-inp 7025 This theorem is referenced by:  genppreclu  7074  genpcuu  7079  genprndu  7081  genpdisj  7082  genpassu  7084  addnqprlemru  7117  mulnqprlemru  7133  distrlem1pru  7142  distrlem5pru  7146  1idpru  7150  ltexprlemfu  7170  recexprlem1ssu  7193  recexprlemss1u  7195  cauappcvgprlemladdfu  7213  caucvgprlemladdfu  7236
 Copyright terms: Public domain W3C validator