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

Theorem mapval2 6572
Description: Alternate expression for the value of set exponentiation. (Contributed by NM, 3-Nov-2007.)
Hypotheses
Ref Expression
elmap.1 𝐴 ∈ V
elmap.2 𝐵 ∈ V
Assertion
Ref Expression
mapval2 (𝐴𝑚 𝐵) = (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵})
Distinct variable group:   𝐵,𝑓
Allowed substitution hint:   𝐴(𝑓)

Proof of Theorem mapval2
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 dff2 5564 . . . 4 (𝑔:𝐵𝐴 ↔ (𝑔 Fn 𝐵𝑔 ⊆ (𝐵 × 𝐴)))
2 ancom 264 . . . 4 ((𝑔 Fn 𝐵𝑔 ⊆ (𝐵 × 𝐴)) ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
31, 2bitri 183 . . 3 (𝑔:𝐵𝐴 ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
4 elmap.1 . . . 4 𝐴 ∈ V
5 elmap.2 . . . 4 𝐵 ∈ V
64, 5elmap 6571 . . 3 (𝑔 ∈ (𝐴𝑚 𝐵) ↔ 𝑔:𝐵𝐴)
7 elin 3259 . . . 4 (𝑔 ∈ (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵}) ↔ (𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∧ 𝑔 ∈ {𝑓𝑓 Fn 𝐵}))
8 velpw 3517 . . . . 5 (𝑔 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝑔 ⊆ (𝐵 × 𝐴))
9 vex 2689 . . . . . 6 𝑔 ∈ V
10 fneq1 5211 . . . . . 6 (𝑓 = 𝑔 → (𝑓 Fn 𝐵𝑔 Fn 𝐵))
119, 10elab 2828 . . . . 5 (𝑔 ∈ {𝑓𝑓 Fn 𝐵} ↔ 𝑔 Fn 𝐵)
128, 11anbi12i 455 . . . 4 ((𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∧ 𝑔 ∈ {𝑓𝑓 Fn 𝐵}) ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
137, 12bitri 183 . . 3 (𝑔 ∈ (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵}) ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
143, 6, 133bitr4i 211 . 2 (𝑔 ∈ (𝐴𝑚 𝐵) ↔ 𝑔 ∈ (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵}))
1514eqriv 2136 1 (𝐴𝑚 𝐵) = (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵})
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1331  wcel 1480  {cab 2125  Vcvv 2686  cin 3070  wss 3071  𝒫 cpw 3510   × cxp 4537   Fn wfn 5118  wf 5119  (class class class)co 5774  𝑚 cmap 6542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-map 6544
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator