Mathbox for Glauco Siliprandi < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unirnmap Structured version   Visualization version   GIF version

Theorem unirnmap 39714
 Description: Given a subset of a set exponentiation, the base set can be restricted. (Contributed by Glauco Siliprandi, 3-Mar-2021.)
Hypotheses
Ref Expression
unirnmap.a (𝜑𝐴𝑉)
unirnmap.x (𝜑𝑋 ⊆ (𝐵𝑚 𝐴))
Assertion
Ref Expression
unirnmap (𝜑𝑋 ⊆ (ran 𝑋𝑚 𝐴))

Proof of Theorem unirnmap
Dummy variables 𝑔 𝑥 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unirnmap.x . . . . . . . 8 (𝜑𝑋 ⊆ (𝐵𝑚 𝐴))
21sselda 3636 . . . . . . 7 ((𝜑𝑔𝑋) → 𝑔 ∈ (𝐵𝑚 𝐴))
3 elmapfn 7922 . . . . . . 7 (𝑔 ∈ (𝐵𝑚 𝐴) → 𝑔 Fn 𝐴)
42, 3syl 17 . . . . . 6 ((𝜑𝑔𝑋) → 𝑔 Fn 𝐴)
5 simplr 807 . . . . . . . . . 10 (((𝜑𝑔𝑋) ∧ 𝑥𝐴) → 𝑔𝑋)
6 dffn3 6092 . . . . . . . . . . . 12 (𝑔 Fn 𝐴𝑔:𝐴⟶ran 𝑔)
74, 6sylib 208 . . . . . . . . . . 11 ((𝜑𝑔𝑋) → 𝑔:𝐴⟶ran 𝑔)
87ffvelrnda 6399 . . . . . . . . . 10 (((𝜑𝑔𝑋) ∧ 𝑥𝐴) → (𝑔𝑥) ∈ ran 𝑔)
9 rneq 5383 . . . . . . . . . . . 12 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
109eleq2d 2716 . . . . . . . . . . 11 (𝑓 = 𝑔 → ((𝑔𝑥) ∈ ran 𝑓 ↔ (𝑔𝑥) ∈ ran 𝑔))
1110rspcev 3340 . . . . . . . . . 10 ((𝑔𝑋 ∧ (𝑔𝑥) ∈ ran 𝑔) → ∃𝑓𝑋 (𝑔𝑥) ∈ ran 𝑓)
125, 8, 11syl2anc 694 . . . . . . . . 9 (((𝜑𝑔𝑋) ∧ 𝑥𝐴) → ∃𝑓𝑋 (𝑔𝑥) ∈ ran 𝑓)
13 eliun 4556 . . . . . . . . 9 ((𝑔𝑥) ∈ 𝑓𝑋 ran 𝑓 ↔ ∃𝑓𝑋 (𝑔𝑥) ∈ ran 𝑓)
1412, 13sylibr 224 . . . . . . . 8 (((𝜑𝑔𝑋) ∧ 𝑥𝐴) → (𝑔𝑥) ∈ 𝑓𝑋 ran 𝑓)
15 rnuni 5579 . . . . . . . 8 ran 𝑋 = 𝑓𝑋 ran 𝑓
1614, 15syl6eleqr 2741 . . . . . . 7 (((𝜑𝑔𝑋) ∧ 𝑥𝐴) → (𝑔𝑥) ∈ ran 𝑋)
1716ralrimiva 2995 . . . . . 6 ((𝜑𝑔𝑋) → ∀𝑥𝐴 (𝑔𝑥) ∈ ran 𝑋)
184, 17jca 553 . . . . 5 ((𝜑𝑔𝑋) → (𝑔 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑔𝑥) ∈ ran 𝑋))
19 ffnfv 6428 . . . . 5 (𝑔:𝐴⟶ran 𝑋 ↔ (𝑔 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑔𝑥) ∈ ran 𝑋))
2018, 19sylibr 224 . . . 4 ((𝜑𝑔𝑋) → 𝑔:𝐴⟶ran 𝑋)
21 ovexd 6720 . . . . . . . . 9 (𝜑 → (𝐵𝑚 𝐴) ∈ V)
2221, 1ssexd 4838 . . . . . . . 8 (𝜑𝑋 ∈ V)
23 uniexg 6997 . . . . . . . 8 (𝑋 ∈ V → 𝑋 ∈ V)
2422, 23syl 17 . . . . . . 7 (𝜑 𝑋 ∈ V)
25 rnexg 7140 . . . . . . 7 ( 𝑋 ∈ V → ran 𝑋 ∈ V)
2624, 25syl 17 . . . . . 6 (𝜑 → ran 𝑋 ∈ V)
27 unirnmap.a . . . . . 6 (𝜑𝐴𝑉)
2826, 27elmapd 7913 . . . . 5 (𝜑 → (𝑔 ∈ (ran 𝑋𝑚 𝐴) ↔ 𝑔:𝐴⟶ran 𝑋))
2928adantr 480 . . . 4 ((𝜑𝑔𝑋) → (𝑔 ∈ (ran 𝑋𝑚 𝐴) ↔ 𝑔:𝐴⟶ran 𝑋))
3020, 29mpbird 247 . . 3 ((𝜑𝑔𝑋) → 𝑔 ∈ (ran 𝑋𝑚 𝐴))
3130ralrimiva 2995 . 2 (𝜑 → ∀𝑔𝑋 𝑔 ∈ (ran 𝑋𝑚 𝐴))
32 dfss3 3625 . 2 (𝑋 ⊆ (ran 𝑋𝑚 𝐴) ↔ ∀𝑔𝑋 𝑔 ∈ (ran 𝑋𝑚 𝐴))
3331, 32sylibr 224 1 (𝜑𝑋 ⊆ (ran 𝑋𝑚 𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1523   ∈ wcel 2030  ∀wral 2941  ∃wrex 2942  Vcvv 3231   ⊆ wss 3607  ∪ cuni 4468  ∪ ciun 4552  ran crn 5144   Fn wfn 5921  ⟶wf 5922  ‘cfv 5926  (class class class)co 6690   ↑𝑚 cmap 7899 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-1st 7210  df-2nd 7211  df-map 7901 This theorem is referenced by:  unirnmapsn  39720
 Copyright terms: Public domain W3C validator