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

Theorem genpmu 7833
Description: The upper cut produced by addition or multiplication on positive reals is inhabited. (Contributed by Jim Kingdon, 5-Dec-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
genpmu ((𝐴P𝐵P) → ∃𝑞Q 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑞,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑞   𝑥,𝐺,𝑦,𝑧,𝑤,𝑣,𝑞   𝐹,𝑞
Allowed substitution hints:   𝐹(𝑥,𝑦,𝑧,𝑤,𝑣)

Proof of Theorem genpmu
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7790 . . . 4 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
2 prmu 7793 . . . 4 (⟨(1st𝐴), (2nd𝐴)⟩ ∈ P → ∃𝑓Q 𝑓 ∈ (2nd𝐴))
3 rexex 2588 . . . 4 (∃𝑓Q 𝑓 ∈ (2nd𝐴) → ∃𝑓 𝑓 ∈ (2nd𝐴))
41, 2, 33syl 17 . . 3 (𝐴P → ∃𝑓 𝑓 ∈ (2nd𝐴))
54adantr 276 . 2 ((𝐴P𝐵P) → ∃𝑓 𝑓 ∈ (2nd𝐴))
6 prop 7790 . . . . 5 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
7 prmu 7793 . . . . 5 (⟨(1st𝐵), (2nd𝐵)⟩ ∈ P → ∃𝑔Q 𝑔 ∈ (2nd𝐵))
8 rexex 2588 . . . . 5 (∃𝑔Q 𝑔 ∈ (2nd𝐵) → ∃𝑔 𝑔 ∈ (2nd𝐵))
96, 7, 83syl 17 . . . 4 (𝐵P → ∃𝑔 𝑔 ∈ (2nd𝐵))
109ad2antlr 489 . . 3 (((𝐴P𝐵P) ∧ 𝑓 ∈ (2nd𝐴)) → ∃𝑔 𝑔 ∈ (2nd𝐵))
11 genpelvl.1 . . . . . . 7 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
12 genpelvl.2 . . . . . . 7 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
1311, 12genppreclu 7830 . . . . . 6 ((𝐴P𝐵P) → ((𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵)) → (𝑓𝐺𝑔) ∈ (2nd ‘(𝐴𝐹𝐵))))
1413imp 124 . . . . 5 (((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) → (𝑓𝐺𝑔) ∈ (2nd ‘(𝐴𝐹𝐵)))
15 elprnqu 7797 . . . . . . . . . 10 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑓 ∈ (2nd𝐴)) → 𝑓Q)
161, 15sylan 283 . . . . . . . . 9 ((𝐴P𝑓 ∈ (2nd𝐴)) → 𝑓Q)
17 elprnqu 7797 . . . . . . . . . 10 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝑔 ∈ (2nd𝐵)) → 𝑔Q)
186, 17sylan 283 . . . . . . . . 9 ((𝐵P𝑔 ∈ (2nd𝐵)) → 𝑔Q)
1916, 18anim12i 338 . . . . . . . 8 (((𝐴P𝑓 ∈ (2nd𝐴)) ∧ (𝐵P𝑔 ∈ (2nd𝐵))) → (𝑓Q𝑔Q))
2019an4s 592 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) → (𝑓Q𝑔Q))
2112caovcl 6209 . . . . . . 7 ((𝑓Q𝑔Q) → (𝑓𝐺𝑔) ∈ Q)
2220, 21syl 14 . . . . . 6 (((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) → (𝑓𝐺𝑔) ∈ Q)
23 simpr 110 . . . . . . 7 ((((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) ∧ 𝑞 = (𝑓𝐺𝑔)) → 𝑞 = (𝑓𝐺𝑔))
2423eleq1d 2301 . . . . . 6 ((((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) ∧ 𝑞 = (𝑓𝐺𝑔)) → (𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ (𝑓𝐺𝑔) ∈ (2nd ‘(𝐴𝐹𝐵))))
2522, 24rspcedv 2925 . . . . 5 (((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) → ((𝑓𝐺𝑔) ∈ (2nd ‘(𝐴𝐹𝐵)) → ∃𝑞Q 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵))))
2614, 25mpd 13 . . . 4 (((𝐴P𝐵P) ∧ (𝑓 ∈ (2nd𝐴) ∧ 𝑔 ∈ (2nd𝐵))) → ∃𝑞Q 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))
2726anassrs 400 . . 3 ((((𝐴P𝐵P) ∧ 𝑓 ∈ (2nd𝐴)) ∧ 𝑔 ∈ (2nd𝐵)) → ∃𝑞Q 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))
2810, 27exlimddv 1948 . 2 (((𝐴P𝐵P) ∧ 𝑓 ∈ (2nd𝐴)) → ∃𝑞Q 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))
295, 28exlimddv 1948 1 ((𝐴P𝐵P) → ∃𝑞Q 𝑞 ∈ (2nd ‘(𝐴𝐹𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005   = wceq 1398  wex 1541  wcel 2203  wrex 2521  {crab 2524  cop 3692  cfv 5352  (class class class)co 6050  cmpo 6052  1st c1st 6332  2nd c2nd 6333  Qcnq 7595  Pcnp 7606
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-qs 6773  df-ni 7619  df-nqqs 7663  df-inp 7781
This theorem is referenced by:  addclpr  7852  mulclpr  7887
  Copyright terms: Public domain W3C validator