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

Theorem mapval2 6815
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 5772 . . . 4 (𝑔:𝐵𝐴 ↔ (𝑔 Fn 𝐵𝑔 ⊆ (𝐵 × 𝐴)))
2 ancom 266 . . . 4 ((𝑔 Fn 𝐵𝑔 ⊆ (𝐵 × 𝐴)) ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
31, 2bitri 184 . . 3 (𝑔:𝐵𝐴 ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
4 elmap.1 . . . 4 𝐴 ∈ V
5 elmap.2 . . . 4 𝐵 ∈ V
64, 5elmap 6814 . . 3 (𝑔 ∈ (𝐴𝑚 𝐵) ↔ 𝑔:𝐵𝐴)
7 elin 3387 . . . 4 (𝑔 ∈ (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵}) ↔ (𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∧ 𝑔 ∈ {𝑓𝑓 Fn 𝐵}))
8 velpw 3656 . . . . 5 (𝑔 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝑔 ⊆ (𝐵 × 𝐴))
9 vex 2802 . . . . . 6 𝑔 ∈ V
10 fneq1 5405 . . . . . 6 (𝑓 = 𝑔 → (𝑓 Fn 𝐵𝑔 Fn 𝐵))
119, 10elab 2947 . . . . 5 (𝑔 ∈ {𝑓𝑓 Fn 𝐵} ↔ 𝑔 Fn 𝐵)
128, 11anbi12i 460 . . . 4 ((𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∧ 𝑔 ∈ {𝑓𝑓 Fn 𝐵}) ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
137, 12bitri 184 . . 3 (𝑔 ∈ (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵}) ↔ (𝑔 ⊆ (𝐵 × 𝐴) ∧ 𝑔 Fn 𝐵))
143, 6, 133bitr4i 212 . 2 (𝑔 ∈ (𝐴𝑚 𝐵) ↔ 𝑔 ∈ (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵}))
1514eqriv 2226 1 (𝐴𝑚 𝐵) = (𝒫 (𝐵 × 𝐴) ∩ {𝑓𝑓 Fn 𝐵})
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1395  wcel 2200  {cab 2215  Vcvv 2799  cin 3196  wss 3197  𝒫 cpw 3649   × cxp 4714   Fn wfn 5309  wf 5310  (class class class)co 5994  𝑚 cmap 6785
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4521  ax-setind 4626
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-id 4381  df-xp 4722  df-rel 4723  df-cnv 4724  df-co 4725  df-dm 4726  df-rn 4727  df-iota 5274  df-fun 5316  df-fn 5317  df-f 5318  df-fv 5322  df-ov 5997  df-oprab 5998  df-mpo 5999  df-map 6787
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator