MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  caofid0l Structured version   Visualization version   GIF version

Theorem caofid0l 7726
Description: Transfer a left identity law to the function operation. (Contributed by NM, 21-Oct-2014.)
Hypotheses
Ref Expression
caofref.1 (𝜑 → 𝐴 ∈ 𝑉)
caofref.2 (𝜑 → 𝐹:𝐴⟶𝑆)
caofid0.3 (𝜑 → 𝐵 ∈ 𝑊)
caofid0l.5 ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝐵𝑅𝑥) = 𝑥)
Assertion
Ref Expression
caofid0l (𝜑 → ((𝐴 × {𝐵}) ∘f 𝑅𝐹) = 𝐹)
Distinct variable groups:   𝑥,𝐵   𝑥,𝐹   𝜑,𝑥   𝑥,𝑅   𝑥,𝑆
Allowed substitution hints:   𝐴(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem caofid0l
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 caofref.1 . 2 (𝜑 → 𝐴 ∈ 𝑉)
2 caofid0.3 . . 3 (𝜑 → 𝐵 ∈ 𝑊)
3 fnconstg 6770 . . 3 (𝐵 ∈ 𝑊 → (𝐴 × {𝐵}) Fn 𝐴)
42, 3syl 18 . 2 (𝜑 → (𝐴 × {𝐵}) Fn 𝐴)
5 caofref.2 . . 3 (𝜑 → 𝐹:𝐴⟶𝑆)
65ffnd 6710 . 2 (𝜑 → 𝐹 Fn 𝐴)
7 fvconst2g 7208 . . 3 ((𝐵 ∈ 𝑊 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
82, 7sylan 592 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
9 eqidd 2761 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
10 caofid0l.5 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝐵𝑅𝑥) = 𝑥)
1110ralrimiva 3154 . . 3 (𝜑 → ∀𝑥 ∈ 𝑆 (𝐵𝑅𝑥) = 𝑥)
125ffvelcdmda 7084 . . 3 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
13 oveq2 7428 . . . . 5 (𝑥 = (𝐹‘𝑤) → (𝐵𝑅𝑥) = (𝐵𝑅(𝐹‘𝑤)))
14 id 23 . . . . 5 (𝑥 = (𝐹‘𝑤) → 𝑥 = (𝐹‘𝑤))
1513, 14eqeq12d 2776 . . . 4 (𝑥 = (𝐹‘𝑤) → ((𝐵𝑅𝑥) = 𝑥 ↔ (𝐵𝑅(𝐹‘𝑤)) = (𝐹‘𝑤)))
1615rspccva 3575 . . 3 ((∀𝑥 ∈ 𝑆 (𝐵𝑅𝑥) = 𝑥 ∧ (𝐹‘𝑤) ∈ 𝑆) → (𝐵𝑅(𝐹‘𝑤)) = (𝐹‘𝑤))
1711, 12, 16syl2an2r 698 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐵𝑅(𝐹‘𝑤)) = (𝐹‘𝑤))
181, 4, 6, 6, 8, 9, 17offveq 7719 1 (𝜑 → ((𝐴 × {𝐵}) ∘f 𝑅𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {csn 4584   × cxp 5648   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∘f cof 7691
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693
This theorem is used by:  mndvlid  18999  psr0lid  22266  psrlmod  22272  lfladd0l  40224  mendlmod  44284
  Copyright terms: Public domain W3C validator