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

Theorem nn0supp 9598
Description: Two ways to write the support of a function on 0. (Contributed by Mario Carneiro, 29-Dec-2014.)
Assertion
Ref Expression
nn0supp (𝐹:𝐼⟶ℕ0 → (𝐹 “ (V ∖ {0})) = (𝐹 “ ℕ))

Proof of Theorem nn0supp
StepHypRef Expression
1 dfn2 9555 . . . 4 ℕ = (ℕ0 ∖ {0})
2 invdif 3473 . . . 4 (ℕ0 ∩ (V ∖ {0})) = (ℕ0 ∖ {0})
31, 2eqtr4i 2262 . . 3 ℕ = (ℕ0 ∩ (V ∖ {0}))
43imaeq2i 5119 . 2 (𝐹 “ ℕ) = (𝐹 “ (ℕ0 ∩ (V ∖ {0})))
5 ffun 5531 . . . 4 (𝐹:𝐼⟶ℕ0 → Fun 𝐹)
6 inpreima 5825 . . . 4 (Fun 𝐹 → (𝐹 “ (ℕ0 ∩ (V ∖ {0}))) = ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))))
75, 6syl 14 . . 3 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (ℕ0 ∩ (V ∖ {0}))) = ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))))
8 cnvimass 5145 . . . . 5 (𝐹 “ (V ∖ {0})) ⊆ dom 𝐹
9 fdm 5534 . . . . . 6 (𝐹:𝐼⟶ℕ0 → dom 𝐹 = 𝐼)
10 fimacnv 5828 . . . . . 6 (𝐹:𝐼⟶ℕ0 → (𝐹 “ ℕ0) = 𝐼)
119, 10eqtr4d 2274 . . . . 5 (𝐹:𝐼⟶ℕ0 → dom 𝐹 = (𝐹 “ ℕ0))
128, 11sseqtrid 3298 . . . 4 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (V ∖ {0})) ⊆ (𝐹 “ ℕ0))
13 sseqin2 3450 . . . 4 ((𝐹 “ (V ∖ {0})) ⊆ (𝐹 “ ℕ0) ↔ ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))) = (𝐹 “ (V ∖ {0})))
1412, 13sylib 122 . . 3 (𝐹:𝐼⟶ℕ0 → ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))) = (𝐹 “ (V ∖ {0})))
157, 14eqtrd 2271 . 2 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (ℕ0 ∩ (V ∖ {0}))) = (𝐹 “ (V ∖ {0})))
164, 15eqtr2id 2284 1 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (V ∖ {0})) = (𝐹 “ ℕ))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1402  Vcvv 2821  cdif 3217  cin 3219  wss 3220  {csn 3705  ccnv 4768  dom cdm 4769  cima 4772  Fun wfun 5366  wf 5368  0cc0 8169  cn 9283  0cn0 9542
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem 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-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-ov 6078  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-inn 9284  df-n0 9543
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator