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

Theorem xpmapen 7154
Description: Equinumerosity law for set exponentiation of a Cartesian product. Exercise 4.47 of [Mendelson] p. 255. (Contributed by NM, 23-Feb-2004.) (Proof shortened by Mario Carneiro, 16-Nov-2014.)
Hypotheses
Ref Expression
xpmapen.1 𝐴 ∈ V
xpmapen.2 𝐵 ∈ V
xpmapen.3 𝐶 ∈ V
Assertion
Ref Expression
xpmapen ((𝐴 × 𝐵) ↑𝑚 𝐶) ≈ ((𝐴 ↑𝑚 𝐶) × (𝐵 ↑𝑚 𝐶))

Proof of Theorem xpmapen
Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpmapen.1 . 2 𝐴 ∈ V
2 xpmapen.2 . 2 𝐵 ∈ V
3 xpmapen.3 . 2 𝐶 ∈ V
4 fveq2 5698 . . . 4 (𝑤 = 𝑧 → (𝑥‘𝑤) = (𝑥‘𝑧))
54fveq2d 5702 . . 3 (𝑤 = 𝑧 → (1st ‘(𝑥‘𝑤)) = (1st ‘(𝑥‘𝑧)))
65cbvmptv 4229 . 2 (𝑤 ∈ 𝐶 ↦ (1st ‘(𝑥‘𝑤))) = (𝑧 ∈ 𝐶 ↦ (1st ‘(𝑥‘𝑧)))
74fveq2d 5702 . . 3 (𝑤 = 𝑧 → (2nd ‘(𝑥‘𝑤)) = (2nd ‘(𝑥‘𝑧)))
87cbvmptv 4229 . 2 (𝑤 ∈ 𝐶 ↦ (2nd ‘(𝑥‘𝑤))) = (𝑧 ∈ 𝐶 ↦ (2nd ‘(𝑥‘𝑧)))
9 fveq2 5698 . . . 4 (𝑤 = 𝑧 → ((1st ‘𝑦)‘𝑤) = ((1st ‘𝑦)‘𝑧))
10 fveq2 5698 . . . 4 (𝑤 = 𝑧 → ((2nd ‘𝑦)‘𝑤) = ((2nd ‘𝑦)‘𝑧))
119, 10opeq12d 3912 . . 3 (𝑤 = 𝑧 → ⟨((1st ‘𝑦)‘𝑤), ((2nd ‘𝑦)‘𝑤)⟩ = ⟨((1st ‘𝑦)‘𝑧), ((2nd ‘𝑦)‘𝑧)⟩)
1211cbvmptv 4229 . 2 (𝑤 ∈ 𝐶 ↦ ⟨((1st ‘𝑦)‘𝑤), ((2nd ‘𝑦)‘𝑤)⟩) = (𝑧 ∈ 𝐶 ↦ ⟨((1st ‘𝑦)‘𝑧), ((2nd ‘𝑦)‘𝑧)⟩)
131, 2, 3, 6, 8, 12xpmapenlem 7153 1 ((𝐴 × 𝐵) ↑𝑚 𝐶) ≈ ((𝐴 ↑𝑚 𝐶) × (𝐵 ↑𝑚 𝐶))
Colors of variables:    wff set class
This proof depends on syntax axioms:   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712   class class class wbr 4131   ↦ cmpt 4193   × cxp 4774  ‘cfv 5380  (class class class)co 6088  1st c1st 6376  2nd c2nd 6377   ↑𝑚 cmap 6926   ≈ cen 7024
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-map 6928  df-en 7027
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator