Theorem suppdm 48870

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 8118	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
2	1	adantr 480	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
3		df-nel 3038	. . . . . 6 ⊢ (𝑍 ∉ ran 𝐹 ↔ ¬ 𝑍 ∈ ran 𝐹)
4		fvelrn 7030	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹)
5	4	3ad2antl1 1187	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹)
6		eleq1 2825	. . . . . . . . 9 ⊢ (𝑍 = (𝐹‘𝑥) → (𝑍 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
7	6	eqcoms 2745	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑍 → (𝑍 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
8	5, 7	syl5ibrcom 247	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) = 𝑍 → 𝑍 ∈ ran 𝐹))
9	8	necon3bd 2947	. . . . . 6 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (¬ 𝑍 ∈ ran 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
10	3, 9	biimtrid 242	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (𝑍 ∉ ran 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
11	10	impancom 451	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝑥 ∈ dom 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
12	11	ralrimiv 3129	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → ∀𝑥 ∈ dom 𝐹(𝐹‘𝑥) ≠ 𝑍)
13		rabid2 3434	. . 3 ⊢ (dom 𝐹 = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍} ↔ ∀𝑥 ∈ dom 𝐹(𝐹‘𝑥) ≠ 𝑍)
14	12, 13	sylibr 234	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → dom 𝐹 = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
15	2, 14	eqtr4d 2775	1 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = dom 𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933   ∉ wnel 3037  ∀wral 3052  {crab 3401  dom cdm 5632  ran crn 5633  Fun wfun 6494  ‘cfv 6500  (class class class)co 7368   supp csupp 8112

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-supp 8113

This theorem is referenced by:  elbigolo1  48917