Theorem suppdm 49953

Description: If the range of a function does not contain the zero, the support of the function equals its domain. (Contributed by AV, 20-May-2020.)

Assertion

Ref	Expression
suppdm	⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = dom 𝐹)

Proof of Theorem suppdm

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppval1 8221	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
2	1	adantr 486	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
3		df-nel 3066	. . . . . 6 ⊢ (𝑍 ∉ ran 𝐹 ↔ ¬ 𝑍 ∈ ran 𝐹)
4		fvelrn 7108	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹)
5	4	3ad2antl1 1204	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹)
6		eleq1 2852	. . . . . . . . 9 ⊢ (𝑍 = (𝐹‘𝑥) → (𝑍 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
7	6	eqcoms 2771	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑍 → (𝑍 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
8	5, 7	syl5ibrcom 250	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) = 𝑍 → 𝑍 ∈ ran 𝐹))
9	8	necon3bd 2973	. . . . . 6 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (¬ 𝑍 ∈ ran 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
10	3, 9	biimtrid 245	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (𝑍 ∉ ran 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
11	10	impancom 457	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝑥 ∈ dom 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
12	11	ralrimiv 3157	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → ∀𝑥 ∈ dom 𝐹(𝐹‘𝑥) ≠ 𝑍)
13		rabid2 3448	. . 3 ⊢ (dom 𝐹 = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍} ↔ ∀𝑥 ∈ dom 𝐹(𝐹‘𝑥) ≠ 𝑍)
14	12, 13	sylibr 237	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → dom 𝐹 = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
15	2, 14	eqtr4d 2801	1 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = dom 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   ∉ wnel 3065  ∀wral 3080  {crab 3416  dom cdm 5658  ran crn 5659  Fun wfun 6560  ‘cfv 6566  (class class class)co 7451   supp csupp 8214

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-supp 8215

This theorem is used by:  elbigolo1  50000