NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  imacok GIF version

Theorem imacok 4283
Description: Image under a composition. (Contributed by SF, 4-Feb-2015.)
Assertion
Ref Expression
imacok ⊢ ((A ∘k B) “k C) = (A “k (B “k C))

Proof of Theorem imacok
Dummy variables x y z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2863 . . . . . 6 ⊢ x ∈ V
2 vex 2863 . . . . . 6 ⊢ z ∈ V
31, 2opkelcok 4263 . . . . 5 ⊢ (⟪x, z⟫ ∈ (A ∘k B) ↔ ∃y(⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
43rexbii 2640 . . . 4 ⊢ (∃x ∈ C ⟪x, z⟫ ∈ (A ∘k B) ↔ ∃x ∈ C ∃y(⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
5 rexcom4 2879 . . . 4 ⊢ (∃x ∈ C ∃y(⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A) ↔ ∃y∃x ∈ C (⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
6 df-rex 2621 . . . . 5 ⊢ (∃y ∈ (B “k C)⟪y, z⟫ ∈ A ↔ ∃y(y ∈ (B “k C) ∧ ⟪y, z⟫ ∈ A))
7 vex 2863 . . . . . . . . 9 ⊢ y ∈ V
87elimak 4260 . . . . . . . 8 ⊢ (y ∈ (B “k C) ↔ ∃x ∈ C ⟪x, y⟫ ∈ B)
98anbi1i 676 . . . . . . 7 ⊢ ((y ∈ (B “k C) ∧ ⟪y, z⟫ ∈ A) ↔ (∃x ∈ C ⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
10 r19.41v 2765 . . . . . . 7 ⊢ (∃x ∈ C (⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A) ↔ (∃x ∈ C ⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
119, 10bitr4i 243 . . . . . 6 ⊢ ((y ∈ (B “k C) ∧ ⟪y, z⟫ ∈ A) ↔ ∃x ∈ C (⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
1211exbii 1582 . . . . 5 ⊢ (∃y(y ∈ (B “k C) ∧ ⟪y, z⟫ ∈ A) ↔ ∃y∃x ∈ C (⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A))
136, 12bitr2i 241 . . . 4 ⊢ (∃y∃x ∈ C (⟪x, y⟫ ∈ B ∧ ⟪y, z⟫ ∈ A) ↔ ∃y ∈ (B “k C)⟪y, z⟫ ∈ A)
144, 5, 133bitri 262 . . 3 ⊢ (∃x ∈ C ⟪x, z⟫ ∈ (A ∘k B) ↔ ∃y ∈ (B “k C)⟪y, z⟫ ∈ A)
152elimak 4260 . . 3 ⊢ (z ∈ ((A ∘k B) “k C) ↔ ∃x ∈ C ⟪x, z⟫ ∈ (A ∘k B))
162elimak 4260 . . 3 ⊢ (z ∈ (A “k (B “k C)) ↔ ∃y ∈ (B “k C)⟪y, z⟫ ∈ A)
1714, 15, 163bitr4i 268 . 2 ⊢ (z ∈ ((A ∘k B) “k C) ↔ z ∈ (A “k (B “k C)))
1817eqriv 2350 1 ⊢ ((A ∘k B) “k C) = (A “k (B “k C))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 358  ∃wex 1541   = wceq 1642   ∈ wcel 1710  ∃wrex 2616  ⟪copk 4058   “k cimak 4180   ∘k ccomk 4181
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-sn 4088
This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-rex 2621  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-ss 3260  df-nul 3552  df-sn 3742  df-pr 3743  df-opk 4059  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator