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

Theorem genpassg 6682
 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 6680 . 2 ((𝐴P𝐵P𝐶P) → (1st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1st ‘(𝐴𝐹(𝐵𝐹𝐶))))
71, 2, 3, 4, 5genpassu 6681 . 2 ((𝐴P𝐵P𝐶P) → (2nd ‘((𝐴𝐹𝐵)𝐹𝐶)) = (2nd ‘(𝐴𝐹(𝐵𝐹𝐶))))
84caovcl 5683 . . . . 5 ((𝐴P𝐵P) → (𝐴𝐹𝐵) ∈ P)
94caovcl 5683 . . . . 5 (((𝐴𝐹𝐵) ∈ P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) ∈ P)
108, 9sylan 271 . . . 4 (((𝐴P𝐵P) ∧ 𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) ∈ P)
11103impa 1110 . . 3 ((𝐴P𝐵P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) ∈ P)
124caovcl 5683 . . . . 5 ((𝐵P𝐶P) → (𝐵𝐹𝐶) ∈ P)
134caovcl 5683 . . . . 5 ((𝐴P ∧ (𝐵𝐹𝐶) ∈ P) → (𝐴𝐹(𝐵𝐹𝐶)) ∈ P)
1412, 13sylan2 274 . . . 4 ((𝐴P ∧ (𝐵P𝐶P)) → (𝐴𝐹(𝐵𝐹𝐶)) ∈ P)
15143impb 1111 . . 3 ((𝐴P𝐵P𝐶P) → (𝐴𝐹(𝐵𝐹𝐶)) ∈ P)
16 preqlu 6628 . . 3 ((((𝐴𝐹𝐵)𝐹𝐶) ∈ P ∧ (𝐴𝐹(𝐵𝐹𝐶)) ∈ P) → (((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) ↔ ((1st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1st ‘(𝐴𝐹(𝐵𝐹𝐶))) ∧ (2nd ‘((𝐴𝐹𝐵)𝐹𝐶)) = (2nd ‘(𝐴𝐹(𝐵𝐹𝐶))))))
1711, 15, 16syl2anc 397 . 2 ((𝐴P𝐵P𝐶P) → (((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) ↔ ((1st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1st ‘(𝐴𝐹(𝐵𝐹𝐶))) ∧ (2nd ‘((𝐴𝐹𝐵)𝐹𝐶)) = (2nd ‘(𝐴𝐹(𝐵𝐹𝐶))))))
186, 7, 17mpbir2and 862 1 ((𝐴P𝐵P𝐶P) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 101   ↔ wb 102   ∧ w3a 896   = wceq 1259   ∈ wcel 1409  ∃wrex 2324  {crab 2327  ⟨cop 3406   × cxp 4371  dom cdm 4373  ‘cfv 4930  (class class class)co 5540   ↦ cmpt2 5542  1st c1st 5793  2nd c2nd 5794  Qcnq 6436  Pcnp 6447 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3900  ax-sep 3903  ax-pow 3955  ax-pr 3972  ax-un 4198  ax-setind 4290  ax-iinf 4339 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2788  df-csb 2881  df-dif 2948  df-un 2950  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-int 3644  df-iun 3687  df-br 3793  df-opab 3847  df-mpt 3848  df-id 4058  df-iom 4342  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-rn 4384  df-res 4385  df-ima 4386  df-iota 4895  df-fun 4932  df-fn 4933  df-f 4934  df-f1 4935  df-fo 4936  df-f1o 4937  df-fv 4938  df-ov 5543  df-oprab 5544  df-mpt2 5545  df-1st 5795  df-2nd 5796  df-qs 6143  df-ni 6460  df-nqqs 6504  df-inp 6622 This theorem is referenced by:  addassprg  6735  mulassprg  6737
 Copyright terms: Public domain W3C validator