Theorem suppdm 49349

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 8168	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
2	1	adantr 486	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
3		df-nel 3067	. . . . . 6 ⊢ (𝑍 ∉ ran 𝐹 ↔ ¬ 𝑍 ∈ ran 𝐹)
4		fvelrn 7075	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹)
5	4	3ad2antl1 1204	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹)
6		eleq1 2853	. . . . . . . . 9 ⊢ (𝑍 = (𝐹‘𝑥) → (𝑍 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
7	6	eqcoms 2773	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑍 → (𝑍 ∈ ran 𝐹 ↔ (𝐹‘𝑥) ∈ ran 𝐹))
8	5, 7	syl5ibrcom 250	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) = 𝑍 → 𝑍 ∈ ran 𝐹))
9	8	necon3bd 2974	. . . . . 6 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (¬ 𝑍 ∈ ran 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
10	3, 9	biimtrid 245	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑥 ∈ dom 𝐹) → (𝑍 ∉ ran 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
11	10	impancom 457	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝑥 ∈ dom 𝐹 → (𝐹‘𝑥) ≠ 𝑍))
12	11	ralrimiv 3158	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → ∀𝑥 ∈ dom 𝐹(𝐹‘𝑥) ≠ 𝑍)
13		rabid2 3451	. . 3 ⊢ (dom 𝐹 = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍} ↔ ∀𝑥 ∈ dom 𝐹(𝐹‘𝑥) ≠ 𝑍)
14	12, 13	sylibr 237	. 2 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → dom 𝐹 = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ≠ 𝑍})
15	2, 14	eqtr4d 2803	1 ⊢ (((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑍 ∉ ran 𝐹) → (𝐹 supp 𝑍) = dom 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ≠ wne 2960   ∉ wnel 3066  ∀wral 3081  {crab 3418  dom cdm 5663  ran crn 5664  Fun wfun 6534  ‘cfv 6540  (class class class)co 7419   supp csupp 8162

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-supp 8163

This theorem is used by:  elbigolo1  49396