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

Theorem ssmapsn 45915
Description: A subset 𝐶 of a set exponentiation to a singleton, is its projection 𝐷 exponentiated to the singleton. (Contributed by Glauco Siliprandi, 3-Mar-2021.)
Hypotheses
Ref Expression
ssmapsn.f 𝑓𝐷
ssmapsn.a (𝜑𝐴𝑉)
ssmapsn.c (𝜑𝐶 ⊆ (𝐵m {𝐴}))
ssmapsn.d 𝐷 = 𝑓𝐶 ran 𝑓
Assertion
Ref Expression
ssmapsn (𝜑𝐶 = (𝐷m {𝐴}))
Distinct variable groups:   𝐴,𝑓   𝐶,𝑓   𝜑,𝑓
Allowed substitution hints:   𝐵(𝑓)   𝐷(𝑓)   𝑉(𝑓)

Proof of Theorem ssmapsn
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 ssmapsn.c . . . . . . . 8 (𝜑𝐶 ⊆ (𝐵m {𝐴}))
21sselda 3938 . . . . . . 7 ((𝜑𝑓𝐶) → 𝑓 ∈ (𝐵m {𝐴}))
3 elmapi 8847 . . . . . . 7 (𝑓 ∈ (𝐵m {𝐴}) → 𝑓:{𝐴}⟶𝐵)
42, 3syl 18 . . . . . 6 ((𝜑𝑓𝐶) → 𝑓:{𝐴}⟶𝐵)
54ffnd 6708 . . . . 5 ((𝜑𝑓𝐶) → 𝑓 Fn {𝐴})
6 ssmapsn.d . . . . . . . 8 𝐷 = 𝑓𝐶 ran 𝑓
76a1i 11 . . . . . . 7 (𝜑𝐷 = 𝑓𝐶 ran 𝑓)
8 ovexd 7447 . . . . . . . . 9 (𝜑 → (𝐵m {𝐴}) ∈ V)
98, 1ssexd 5296 . . . . . . . 8 (𝜑𝐶 ∈ V)
10 rnexg 7900 . . . . . . . . 9 (𝑓𝐶 → ran 𝑓 ∈ V)
1110rgen 3081 . . . . . . . 8 𝑓𝐶 ran 𝑓 ∈ V
12 iunexg 7961 . . . . . . . 8 ((𝐶 ∈ V ∧ ∀𝑓𝐶 ran 𝑓 ∈ V) → 𝑓𝐶 ran 𝑓 ∈ V)
139, 11, 12sylancl 597 . . . . . . 7 (𝜑 𝑓𝐶 ran 𝑓 ∈ V)
147, 13eqeltrd 2863 . . . . . 6 (𝜑𝐷 ∈ V)
1514adantr 485 . . . . 5 ((𝜑𝑓𝐶) → 𝐷 ∈ V)
16 ssiun2 5013 . . . . . . . 8 (𝑓𝐶 → ran 𝑓 𝑓𝐶 ran 𝑓)
1716adantl 486 . . . . . . 7 ((𝜑𝑓𝐶) → ran 𝑓 𝑓𝐶 ran 𝑓)
18 ssmapsn.a . . . . . . . . . 10 (𝜑𝐴𝑉)
19 snidg 4627 . . . . . . . . . 10 (𝐴𝑉𝐴 ∈ {𝐴})
2018, 19syl 18 . . . . . . . . 9 (𝜑𝐴 ∈ {𝐴})
2120adantr 485 . . . . . . . 8 ((𝜑𝑓𝐶) → 𝐴 ∈ {𝐴})
225, 21fnfvelrnd 7079 . . . . . . 7 ((𝜑𝑓𝐶) → (𝑓𝐴) ∈ ran 𝑓)
2317, 22sseldd 3939 . . . . . 6 ((𝜑𝑓𝐶) → (𝑓𝐴) ∈ 𝑓𝐶 ran 𝑓)
2423, 6eleqtrrdi 2874 . . . . 5 ((𝜑𝑓𝐶) → (𝑓𝐴) ∈ 𝐷)
255, 15, 24elmapsnd 45904 . . . 4 ((𝜑𝑓𝐶) → 𝑓 ∈ (𝐷m {𝐴}))
2614adantr 485 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝐷 ∈ V)
27 snex 5412 . . . . . . . . 9 {𝐴} ∈ V
2827a1i 11 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → {𝐴} ∈ V)
29 simpr 489 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝑓 ∈ (𝐷m {𝐴}))
3020adantr 485 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝐴 ∈ {𝐴})
3126, 28, 29, 30fvmap 45898 . . . . . . 7 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → (𝑓𝐴) ∈ 𝐷)
32 rneq 5928 . . . . . . . . 9 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
3332cbviunv 5004 . . . . . . . 8 𝑓𝐶 ran 𝑓 = 𝑔𝐶 ran 𝑔
346, 33eqtri 2786 . . . . . . 7 𝐷 = 𝑔𝐶 ran 𝑔
3531, 34eleqtrdi 2873 . . . . . 6 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → (𝑓𝐴) ∈ 𝑔𝐶 ran 𝑔)
36 eliun 4961 . . . . . 6 ((𝑓𝐴) ∈ 𝑔𝐶 ran 𝑔 ↔ ∃𝑔𝐶 (𝑓𝐴) ∈ ran 𝑔)
3735, 36sylib 221 . . . . 5 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → ∃𝑔𝐶 (𝑓𝐴) ∈ ran 𝑔)
38 simp3 1156 . . . . . . . 8 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → (𝑓𝐴) ∈ ran 𝑔)
39 simp1l 1216 . . . . . . . . . 10 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝜑)
4039, 18syl 18 . . . . . . . . 9 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝐴𝑉)
41 eqid 2763 . . . . . . . . 9 {𝐴} = {𝐴}
42 simp1r 1217 . . . . . . . . . 10 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓 ∈ (𝐷m {𝐴}))
43 elmapfn 8863 . . . . . . . . . 10 (𝑓 ∈ (𝐷m {𝐴}) → 𝑓 Fn {𝐴})
4442, 43syl 18 . . . . . . . . 9 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓 Fn {𝐴})
451sselda 3938 . . . . . . . . . . . 12 ((𝜑𝑔𝐶) → 𝑔 ∈ (𝐵m {𝐴}))
46 elmapfn 8863 . . . . . . . . . . . 12 (𝑔 ∈ (𝐵m {𝐴}) → 𝑔 Fn {𝐴})
4745, 46syl 18 . . . . . . . . . . 11 ((𝜑𝑔𝐶) → 𝑔 Fn {𝐴})
48473adant3 1150 . . . . . . . . . 10 ((𝜑𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
49483adant1r 1196 . . . . . . . . 9 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
5040, 41, 44, 49fsneqrn 45910 . . . . . . . 8 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → (𝑓 = 𝑔 ↔ (𝑓𝐴) ∈ ran 𝑔))
5138, 50mpbird 260 . . . . . . 7 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓 = 𝑔)
52 simp2 1155 . . . . . . 7 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑔𝐶)
5351, 52eqeltrd 2863 . . . . . 6 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓𝐶)
5453rexlimdv3a 3170 . . . . 5 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → (∃𝑔𝐶 (𝑓𝐴) ∈ ran 𝑔𝑓𝐶))
5537, 54mpd 16 . . . 4 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝑓𝐶)
5625, 55impbida 812 . . 3 (𝜑 → (𝑓𝐶𝑓 ∈ (𝐷m {𝐴})))
5756alrimiv 1957 . 2 (𝜑 → ∀𝑓(𝑓𝐶𝑓 ∈ (𝐷m {𝐴})))
58 nfcv 2925 . . 3 𝑓𝐶
59 ssmapsn.f . . . 4 𝑓𝐷
60 nfcv 2925 . . . 4 𝑓m
61 nfcv 2925 . . . 4 𝑓{𝐴}
6259, 60, 61nfov 7442 . . 3 𝑓(𝐷m {𝐴})
6358, 62cleqf 2953 . 2 (𝐶 = (𝐷m {𝐴}) ↔ ∀𝑓(𝑓𝐶𝑓 ∈ (𝐷m {𝐴})))
6457, 63sylibr 237 1 (𝜑𝐶 = (𝐷m {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1103  wal 1568   = wceq 1570  wcel 2143  wnfc 2910  wral 3079  wrex 3089  Vcvv 3455  wss 3906  {csn 4590   ciun 4957  ran crn 5664   Fn wfn 6533  wf 6534  cfv 6538  (class class class)co 7412  m cmap 8825
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7987  df-2nd 7988  df-map 8827
This theorem is referenced by:  vonvolmbllem  47357  vonvolmbl2  47360  vonvol2  47361
  Copyright terms: Public domain W3C validator