Theorem wdomima2g 9551

Description: A set is weakly dominant over its image under any function. This version of wdomimag 9552 is stated so as to avoid ax-rep 5240. (Contributed by Mario Carneiro, 25-Jun-2015.)

Assertion

Ref	Expression
wdomima2g	⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 “ 𝐴) ≼* 𝐴)

Proof of Theorem wdomima2g

Step	Hyp	Ref	Expression
1		df-ima 5676	. 2 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
2		funres 6582	. . . . . . . 8 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
3		funforn 6803	. . . . . . . 8 ⊢ (Fun (𝐹 ↾ 𝐴) ↔ (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)–onto→ran (𝐹 ↾ 𝐴))
4	2, 3	sylib 221	. . . . . . 7 ⊢ (Fun 𝐹 → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)–onto→ran (𝐹 ↾ 𝐴))
5	4	3ad2ant1 1151	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)–onto→ran (𝐹 ↾ 𝐴))
6		fof 6796	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)–onto→ran (𝐹 ↾ 𝐴) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ran (𝐹 ↾ 𝐴))
7	5, 6	syl 18	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ran (𝐹 ↾ 𝐴))
8		dmres 6013	. . . . . . 7 ⊢ dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
9		inss1 4189	. . . . . . 7 ⊢ (𝐴 ∩ dom 𝐹) ⊆ 𝐴
10	8, 9	eqsstri 3984	. . . . . 6 ⊢ dom (𝐹 ↾ 𝐴) ⊆ 𝐴
11		simp2 1155	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → 𝐴 ∈ 𝑉)
12		ssexg 5292	. . . . . 6 ⊢ ((dom (𝐹 ↾ 𝐴) ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → dom (𝐹 ↾ 𝐴) ∈ V)
13	10, 11, 12	sylancr 599	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → dom (𝐹 ↾ 𝐴) ∈ V)
14		simp3 1156	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 “ 𝐴) ∈ 𝑊)
15	1, 14	eqeltrrid 2870	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → ran (𝐹 ↾ 𝐴) ∈ 𝑊)
16		fex2 7935	. . . . 5 ⊢ (((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ran (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) ∈ V ∧ ran (𝐹 ↾ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴) ∈ V)
17	7, 13, 15, 16	syl3anc 1398	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴) ∈ V)
18		fowdom 9536	. . . 4 ⊢ (((𝐹 ↾ 𝐴) ∈ V ∧ (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)–onto→ran (𝐹 ↾ 𝐴)) → ran (𝐹 ↾ 𝐴) ≼* dom (𝐹 ↾ 𝐴))
19	17, 5, 18	syl2anc 596	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → ran (𝐹 ↾ 𝐴) ≼* dom (𝐹 ↾ 𝐴))
20		ssdomg 8999	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (dom (𝐹 ↾ 𝐴) ⊆ 𝐴 → dom (𝐹 ↾ 𝐴) ≼ 𝐴))
21	10, 20	mpi 21	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → dom (𝐹 ↾ 𝐴) ≼ 𝐴)
22		domwdom 9539	. . . . 5 ⊢ (dom (𝐹 ↾ 𝐴) ≼ 𝐴 → dom (𝐹 ↾ 𝐴) ≼* 𝐴)
23	21, 22	syl 18	. . . 4 ⊢ (𝐴 ∈ 𝑉 → dom (𝐹 ↾ 𝐴) ≼* 𝐴)
24	23	3ad2ant2 1152	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → dom (𝐹 ↾ 𝐴) ≼* 𝐴)
25		wdomtr 9540	. . 3 ⊢ ((ran (𝐹 ↾ 𝐴) ≼* dom (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) ≼* 𝐴) → ran (𝐹 ↾ 𝐴) ≼* 𝐴)
26	19, 24, 25	syl2anc 596	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → ran (𝐹 ↾ 𝐴) ≼* 𝐴)
27	1, 26	eqbrtrid 5148	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 “ 𝐴) ≼* 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   ∈ wcel 2146  Vcvv 3457   ∩ cin 3905   ⊆ wss 3906   class class class wbr 5111  dom cdm 5663  ran crn 5664   ↾ cres 5665   “ cima 5666  Fun wfun 6534  ⟶wf 6536  –onto→wfo 6538   ≼ cdom 8943   ≼^* cwdom 9529

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-pow 5338  ax-pr 5406  ax-un 7738

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-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  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-mpt 5195  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-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-en 8946  df-dom 8947  df-sdom 8948  df-wdom 9530

This theorem is used by:  wdomimag  9552  unxpwdom2  9553