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

Theorem nn0supp 9453
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 9414 . . . 4 ℕ = (ℕ0 ∖ {0})
2 invdif 3449 . . . 4 (ℕ0 ∩ (V ∖ {0})) = (ℕ0 ∖ {0})
31, 2eqtr4i 2255 . . 3 ℕ = (ℕ0 ∩ (V ∖ {0}))
43imaeq2i 5074 . 2 (𝐹 “ ℕ) = (𝐹 “ (ℕ0 ∩ (V ∖ {0})))
5 ffun 5485 . . . 4 (𝐹:𝐼⟶ℕ0 → Fun 𝐹)
6 inpreima 5773 . . . 4 (Fun 𝐹 → (𝐹 “ (ℕ0 ∩ (V ∖ {0}))) = ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))))
75, 6syl 14 . . 3 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (ℕ0 ∩ (V ∖ {0}))) = ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))))
8 cnvimass 5099 . . . . 5 (𝐹 “ (V ∖ {0})) ⊆ dom 𝐹
9 fdm 5488 . . . . . 6 (𝐹:𝐼⟶ℕ0 → dom 𝐹 = 𝐼)
10 fimacnv 5776 . . . . . 6 (𝐹:𝐼⟶ℕ0 → (𝐹 “ ℕ0) = 𝐼)
119, 10eqtr4d 2267 . . . . 5 (𝐹:𝐼⟶ℕ0 → dom 𝐹 = (𝐹 “ ℕ0))
128, 11sseqtrid 3277 . . . 4 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (V ∖ {0})) ⊆ (𝐹 “ ℕ0))
13 sseqin2 3426 . . . 4 ((𝐹 “ (V ∖ {0})) ⊆ (𝐹 “ ℕ0) ↔ ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))) = (𝐹 “ (V ∖ {0})))
1412, 13sylib 122 . . 3 (𝐹:𝐼⟶ℕ0 → ((𝐹 “ ℕ0) ∩ (𝐹 “ (V ∖ {0}))) = (𝐹 “ (V ∖ {0})))
157, 14eqtrd 2264 . 2 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (ℕ0 ∩ (V ∖ {0}))) = (𝐹 “ (V ∖ {0})))
164, 15eqtr2id 2277 1 (𝐹:𝐼⟶ℕ0 → (𝐹 “ (V ∖ {0})) = (𝐹 “ ℕ))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1397  Vcvv 2802  cdif 3197  cin 3199  wss 3200  {csn 3669  ccnv 4724  dom cdm 4725  cima 4728  Fun wfun 5320  wf 5322  0cc0 8031  cn 9142  0cn0 9401
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-ov 6020  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-inn 9143  df-n0 9402
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator