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

Theorem genpdf 7507
Description: Simplified definition of addition or multiplication on positive reals. (Contributed by Jim Kingdon, 30-Sep-2019.)
Hypothesis
Ref Expression
genpdf.1 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑤) ∧ 𝑠 ∈ (1st𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑤) ∧ 𝑠 ∈ (2nd𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}⟩)
Assertion
Ref Expression
genpdf 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑞Q ∣ ∃𝑟 ∈ (1st𝑤)∃𝑠 ∈ (1st𝑣)𝑞 = (𝑟𝐺𝑠)}, {𝑞Q ∣ ∃𝑟 ∈ (2nd𝑤)∃𝑠 ∈ (2nd𝑣)𝑞 = (𝑟𝐺𝑠)}⟩)
Distinct variable group:   𝑟,𝑞,𝑠,𝑣,𝑤
Allowed substitution hints:   𝐹(𝑤,𝑣,𝑠,𝑟,𝑞)   𝐺(𝑤,𝑣,𝑠,𝑟,𝑞)

Proof of Theorem genpdf
StepHypRef Expression
1 genpdf.1 . 2 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑤) ∧ 𝑠 ∈ (1st𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑤) ∧ 𝑠 ∈ (2nd𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}⟩)
2 prop 7474 . . . . . . 7 (𝑤P → ⟨(1st𝑤), (2nd𝑤)⟩ ∈ P)
3 elprnql 7480 . . . . . . 7 ((⟨(1st𝑤), (2nd𝑤)⟩ ∈ P𝑟 ∈ (1st𝑤)) → 𝑟Q)
42, 3sylan 283 . . . . . 6 ((𝑤P𝑟 ∈ (1st𝑤)) → 𝑟Q)
54adantlr 477 . . . . 5 (((𝑤P𝑣P) ∧ 𝑟 ∈ (1st𝑤)) → 𝑟Q)
6 prop 7474 . . . . . . 7 (𝑣P → ⟨(1st𝑣), (2nd𝑣)⟩ ∈ P)
7 elprnql 7480 . . . . . . 7 ((⟨(1st𝑣), (2nd𝑣)⟩ ∈ P𝑠 ∈ (1st𝑣)) → 𝑠Q)
86, 7sylan 283 . . . . . 6 ((𝑣P𝑠 ∈ (1st𝑣)) → 𝑠Q)
98adantll 476 . . . . 5 (((𝑤P𝑣P) ∧ 𝑠 ∈ (1st𝑣)) → 𝑠Q)
105, 9genpdflem 7506 . . . 4 ((𝑤P𝑣P) → {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑤) ∧ 𝑠 ∈ (1st𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))} = {𝑞Q ∣ ∃𝑟 ∈ (1st𝑤)∃𝑠 ∈ (1st𝑣)𝑞 = (𝑟𝐺𝑠)})
11 elprnqu 7481 . . . . . . 7 ((⟨(1st𝑤), (2nd𝑤)⟩ ∈ P𝑟 ∈ (2nd𝑤)) → 𝑟Q)
122, 11sylan 283 . . . . . 6 ((𝑤P𝑟 ∈ (2nd𝑤)) → 𝑟Q)
1312adantlr 477 . . . . 5 (((𝑤P𝑣P) ∧ 𝑟 ∈ (2nd𝑤)) → 𝑟Q)
14 elprnqu 7481 . . . . . . 7 ((⟨(1st𝑣), (2nd𝑣)⟩ ∈ P𝑠 ∈ (2nd𝑣)) → 𝑠Q)
156, 14sylan 283 . . . . . 6 ((𝑣P𝑠 ∈ (2nd𝑣)) → 𝑠Q)
1615adantll 476 . . . . 5 (((𝑤P𝑣P) ∧ 𝑠 ∈ (2nd𝑣)) → 𝑠Q)
1713, 16genpdflem 7506 . . . 4 ((𝑤P𝑣P) → {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑤) ∧ 𝑠 ∈ (2nd𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))} = {𝑞Q ∣ ∃𝑟 ∈ (2nd𝑤)∃𝑠 ∈ (2nd𝑣)𝑞 = (𝑟𝐺𝑠)})
1810, 17opeq12d 3787 . . 3 ((𝑤P𝑣P) → ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑤) ∧ 𝑠 ∈ (1st𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑤) ∧ 𝑠 ∈ (2nd𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}⟩ = ⟨{𝑞Q ∣ ∃𝑟 ∈ (1st𝑤)∃𝑠 ∈ (1st𝑣)𝑞 = (𝑟𝐺𝑠)}, {𝑞Q ∣ ∃𝑟 ∈ (2nd𝑤)∃𝑠 ∈ (2nd𝑣)𝑞 = (𝑟𝐺𝑠)}⟩)
1918mpoeq3ia 5940 . 2 (𝑤P, 𝑣P ↦ ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑤) ∧ 𝑠 ∈ (1st𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑤) ∧ 𝑠 ∈ (2nd𝑣) ∧ 𝑞 = (𝑟𝐺𝑠))}⟩) = (𝑤P, 𝑣P ↦ ⟨{𝑞Q ∣ ∃𝑟 ∈ (1st𝑤)∃𝑠 ∈ (1st𝑣)𝑞 = (𝑟𝐺𝑠)}, {𝑞Q ∣ ∃𝑟 ∈ (2nd𝑤)∃𝑠 ∈ (2nd𝑣)𝑞 = (𝑟𝐺𝑠)}⟩)
201, 19eqtri 2198 1 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑞Q ∣ ∃𝑟 ∈ (1st𝑤)∃𝑠 ∈ (1st𝑣)𝑞 = (𝑟𝐺𝑠)}, {𝑞Q ∣ ∃𝑟 ∈ (2nd𝑤)∃𝑠 ∈ (2nd𝑣)𝑞 = (𝑟𝐺𝑠)}⟩)
Colors of variables: wff set class
Syntax hints:  wa 104  w3a 978   = wceq 1353  wcel 2148  wrex 2456  {crab 2459  cop 3596  cfv 5217  (class class class)co 5875  cmpo 5877  1st c1st 6139  2nd c2nd 6140  Qcnq 7279  Pcnp 7290
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-iinf 4588
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-id 4294  df-iom 4591  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-oprab 5879  df-mpo 5880  df-1st 6141  df-2nd 6142  df-qs 6541  df-ni 7303  df-nqqs 7347  df-inp 7465
This theorem is referenced by:  genipv  7508
  Copyright terms: Public domain W3C validator