MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  wdomima2g Structured version   Visualization version   GIF version

Theorem wdomima2g 9617
Description: A set is weakly dominant over its image under any function. This version of wdomimag 9618 is stated so as to avoid ax-rep 5238. (Contributed by Mario Carneiro, 25-Jun-2015.)
Assertion
Ref Expression
wdomima2g ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 “ 𝐴) ≼* 𝐴)

Proof of Theorem wdomima2g
StepHypRef Expression
1 df-ima 5671 . 2 (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
2 funres 6610 . . . . . . . 8 (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
3 funforn 6833 . . . . . . . 8 (Fun (𝐹 ↾ 𝐴) ↔ (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ontoran (𝐹 ↾ 𝐴))
42, 3sylib 221 . . . . . . 7 (Fun 𝐹 → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ontoran (𝐹 ↾ 𝐴))
543ad2ant1 1151 . . . . . 6 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ontoran (𝐹 ↾ 𝐴))
6 fof 6826 . . . . . 6 ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ontoran (𝐹 ↾ 𝐴) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ran (𝐹 ↾ 𝐴))
75, 6syl 18 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ran (𝐹 ↾ 𝐴))
8 dmres 6020 . . . . . . 7 dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
9 inss1 4136 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
108, 9eqsstri 3959 . . . . . 6 dom (𝐹 ↾ 𝐴) ⊆ 𝐴
11 simp2 1155 . . . . . 6 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → 𝐴 ∈ 𝑉)
12 ssexg 5288 . . . . . 6 ((dom (𝐹 ↾ 𝐴) ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → dom (𝐹 ↾ 𝐴) ∈ V)
1310, 11, 12sylancr 599 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → dom (𝐹 ↾ 𝐴) ∈ V)
14 simp3 1156 . . . . . 6 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 “ 𝐴) ∈ 𝑊)
151, 14eqeltrrid 2869 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → ran (𝐹 ↾ 𝐴) ∈ 𝑊)
16 fex2 7982 . . . . 5 (((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ran (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) ∈ V ∧ ran (𝐹 ↾ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴) ∈ V)
177, 13, 15, 16syl3anc 1399 . . . 4 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 ↾ 𝐴) ∈ V)
18 fowdom 9602 . . . 4 (((𝐹 ↾ 𝐴) ∈ V ∧ (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶ontoran (𝐹 ↾ 𝐴)) → ran (𝐹 ↾ 𝐴) ≼* dom (𝐹 ↾ 𝐴))
1917, 5, 18syl2anc 596 . . 3 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → ran (𝐹 ↾ 𝐴) ≼* dom (𝐹 ↾ 𝐴))
20 ssdomg 9065 . . . . . 6 (𝐴 ∈ 𝑉 → (dom (𝐹 ↾ 𝐴) ⊆ 𝐴 → dom (𝐹 ↾ 𝐴) ≼ 𝐴))
2110, 20mpi 21 . . . . 5 (𝐴 ∈ 𝑉 → dom (𝐹 ↾ 𝐴) ≼ 𝐴)
22 domwdom 9605 . . . . 5 (dom (𝐹 ↾ 𝐴) ≼ 𝐴 → dom (𝐹 ↾ 𝐴) ≼* 𝐴)
2321, 22syl 18 . . . 4 (𝐴 ∈ 𝑉 → dom (𝐹 ↾ 𝐴) ≼* 𝐴)
24233ad2ant2 1152 . . 3 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → dom (𝐹 ↾ 𝐴) ≼* 𝐴)
25 wdomtr 9606 . . 3 ((ran (𝐹 ↾ 𝐴) ≼* dom (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) ≼* 𝐴) → ran (𝐹 ↾ 𝐴) ≼* 𝐴)
2619, 24, 25syl2anc 596 . 2 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → ran (𝐹 ↾ 𝐴) ≼* 𝐴)
271, 26eqbrtrid 5146 1 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉 ∧ (𝐹 “ 𝐴) ∈ 𝑊) → (𝐹 “ 𝐴) ≼* 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   class class class wbr 5108  dom cdm 5658  ran crn 5659   ↾ cres 5660   “ cima 5661  Fun wfun 6560  ⟶wf 6562  ⟶ontowfo 6564   ≼ cdom 9009   ≼* cwdom 9595
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-pow 5334  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  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-mpt 5193  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-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-en 9012  df-dom 9013  df-sdom 9014  df-wdom 9596
This theorem is used by:  wdomimag  9618  unxpwdom2  9619
  Copyright terms: Public domain W3C validator