Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ofcs1 Structured version   Visualization version   GIF version

Theorem ofcs1 30401
 Description: Letterwise operations on a single letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.)
Assertion
Ref Expression
ofcs1 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩∘𝑓/𝑐𝑅𝐵) = ⟨“(𝐴𝑅𝐵)”⟩)

Proof of Theorem ofcs1
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 snex 4869 . . . 4 {0} ∈ V
21a1i 11 . . 3 ((𝐴𝑆𝐵𝑇) → {0} ∈ V)
3 simpr 477 . . 3 ((𝐴𝑆𝐵𝑇) → 𝐵𝑇)
4 simpll 789 . . 3 (((𝐴𝑆𝐵𝑇) ∧ 𝑖 ∈ {0}) → 𝐴𝑆)
5 s1val 13317 . . . . 5 (𝐴𝑆 → ⟨“𝐴”⟩ = {⟨0, 𝐴⟩})
6 0nn0 11251 . . . . . 6 0 ∈ ℕ0
7 fmptsn 6387 . . . . . 6 ((0 ∈ ℕ0𝐴𝑆) → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
86, 7mpan 705 . . . . 5 (𝐴𝑆 → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
95, 8eqtrd 2655 . . . 4 (𝐴𝑆 → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
109adantr 481 . . 3 ((𝐴𝑆𝐵𝑇) → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
112, 3, 4, 10ofcfval2 29947 . 2 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩∘𝑓/𝑐𝑅𝐵) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
12 ovex 6632 . . . 4 (𝐴𝑅𝐵) ∈ V
13 s1val 13317 . . . 4 ((𝐴𝑅𝐵) ∈ V → ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩})
1412, 13ax-mp 5 . . 3 ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩}
15 fmptsn 6387 . . . 4 ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
166, 12, 15mp2an 707 . . 3 {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
1714, 16eqtri 2643 . 2 ⟨“(𝐴𝑅𝐵)”⟩ = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
1811, 17syl6eqr 2673 1 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩∘𝑓/𝑐𝑅𝐵) = ⟨“(𝐴𝑅𝐵)”⟩)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480   ∈ wcel 1987  Vcvv 3186  {csn 4148  ⟨cop 4154   ↦ cmpt 4673  (class class class)co 6604  0cc0 9880  ℕ0cn0 11236  ⟨“cs1 13233  ∘𝑓/𝑐cofc 29938 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-1cn 9938  ax-icn 9939  ax-addcl 9940  ax-mulcl 9942  ax-i2m1 9948 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-n0 11237  df-s1 13241  df-ofc 29939 This theorem is referenced by:  ofcs2  30402
 Copyright terms: Public domain W3C validator