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

Theorem genpassg 6988
Description: Associativity of an operation on reals. (Contributed by Jim Kingdon, 11-Dec-2019.)
Hypotheses
Ref Expression
genpelvl.1 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
genpassg.4 dom 𝐹 = (P × P)
genpassg.5 ((𝑓P𝑔P) → (𝑓𝐹𝑔) ∈ P)
genpassg.6 ((𝑓Q𝑔QQ) → ((𝑓𝐺𝑔)𝐺) = (𝑓𝐺(𝑔𝐺)))
Assertion
Ref Expression
genpassg ((𝐴P𝐵P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑓,𝑔,,𝑤,𝑣,𝐴   𝑥,𝐵,𝑦,𝑧,𝑓,𝑔,,𝑤,𝑣   𝑥,𝐺,𝑦,𝑧,𝑓,𝑔,,𝑤,𝑣   𝑓,𝐹,𝑔   𝐶,𝑓,𝑔,,𝑣,𝑤,𝑥,𝑦,𝑧   ,𝐹,𝑣,𝑤,𝑥,𝑦,𝑧

Proof of Theorem genpassg
StepHypRef Expression
1 genpelvl.1 . . 3 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
2 genpelvl.2 . . 3 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
3 genpassg.4 . . 3 dom 𝐹 = (P × P)
4 genpassg.5 . . 3 ((𝑓P𝑔P) → (𝑓𝐹𝑔) ∈ P)
5 genpassg.6 . . 3 ((𝑓Q𝑔QQ) → ((𝑓𝐺𝑔)𝐺) = (𝑓𝐺(𝑔𝐺)))
61, 2, 3, 4, 5genpassl 6986 . 2 ((𝐴P𝐵P𝐶P) → (1st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1st ‘(𝐴𝐹(𝐵𝐹𝐶))))
71, 2, 3, 4, 5genpassu 6987 . 2 ((𝐴P𝐵P𝐶P) → (2nd ‘((𝐴𝐹𝐵)𝐹𝐶)) = (2nd ‘(𝐴𝐹(𝐵𝐹𝐶))))
84caovcl 5734 . . . . 5 ((𝐴P𝐵P) → (𝐴𝐹𝐵) ∈ P)
94caovcl 5734 . . . . 5 (((𝐴𝐹𝐵) ∈ P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) ∈ P)
108, 9sylan 277 . . . 4 (((𝐴P𝐵P) ∧ 𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) ∈ P)
11103impa 1134 . . 3 ((𝐴P𝐵P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) ∈ P)
124caovcl 5734 . . . . 5 ((𝐵P𝐶P) → (𝐵𝐹𝐶) ∈ P)
134caovcl 5734 . . . . 5 ((𝐴P ∧ (𝐵𝐹𝐶) ∈ P) → (𝐴𝐹(𝐵𝐹𝐶)) ∈ P)
1412, 13sylan2 280 . . . 4 ((𝐴P ∧ (𝐵P𝐶P)) → (𝐴𝐹(𝐵𝐹𝐶)) ∈ P)
15143impb 1135 . . 3 ((𝐴P𝐵P𝐶P) → (𝐴𝐹(𝐵𝐹𝐶)) ∈ P)
16 preqlu 6934 . . 3 ((((𝐴𝐹𝐵)𝐹𝐶) ∈ P ∧ (𝐴𝐹(𝐵𝐹𝐶)) ∈ P) → (((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) ↔ ((1st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1st ‘(𝐴𝐹(𝐵𝐹𝐶))) ∧ (2nd ‘((𝐴𝐹𝐵)𝐹𝐶)) = (2nd ‘(𝐴𝐹(𝐵𝐹𝐶))))))
1711, 15, 16syl2anc 403 . 2 ((𝐴P𝐵P𝐶P) → (((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) ↔ ((1st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1st ‘(𝐴𝐹(𝐵𝐹𝐶))) ∧ (2nd ‘((𝐴𝐹𝐵)𝐹𝐶)) = (2nd ‘(𝐴𝐹(𝐵𝐹𝐶))))))
186, 7, 17mpbir2and 886 1 ((𝐴P𝐵P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103  w3a 920   = wceq 1285  wcel 1434  wrex 2354  {crab 2357  cop 3425   × cxp 4399  dom cdm 4401  cfv 4969  (class class class)co 5591  cmpt2 5593  1st c1st 5844  2nd c2nd 5845  Qcnq 6742  Pcnp 6753
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 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3919  ax-sep 3922  ax-pow 3974  ax-pr 4000  ax-un 4224  ax-setind 4316  ax-iinf 4366
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2614  df-sbc 2827  df-csb 2920  df-dif 2986  df-un 2988  df-in 2990  df-ss 2997  df-pw 3408  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-int 3663  df-iun 3706  df-br 3812  df-opab 3866  df-mpt 3867  df-id 4084  df-iom 4369  df-xp 4407  df-rel 4408  df-cnv 4409  df-co 4410  df-dm 4411  df-rn 4412  df-res 4413  df-ima 4414  df-iota 4934  df-fun 4971  df-fn 4972  df-f 4973  df-f1 4974  df-fo 4975  df-f1o 4976  df-fv 4977  df-ov 5594  df-oprab 5595  df-mpt2 5596  df-1st 5846  df-2nd 5847  df-qs 6228  df-ni 6766  df-nqqs 6810  df-inp 6928
This theorem is referenced by:  addassprg  7041  mulassprg  7043
  Copyright terms: Public domain W3C validator