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 45752
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 3934 . . . . . . 7 ((𝜑𝑓𝐶) → 𝑓 ∈ (𝐵m {𝐴}))
3 elmapi 8823 . . . . . . 7 (𝑓 ∈ (𝐵m {𝐴}) → 𝑓:{𝐴}⟶𝐵)
42, 3syl 17 . . . . . 6 ((𝜑𝑓𝐶) → 𝑓:{𝐴}⟶𝐵)
54ffnd 6686 . . . . 5 ((𝜑𝑓𝐶) → 𝑓 Fn {𝐴})
6 ssmapsn.d . . . . . . . 8 𝐷 = 𝑓𝐶 ran 𝑓
76a1i 11 . . . . . . 7 (𝜑𝐷 = 𝑓𝐶 ran 𝑓)
8 ovexd 7425 . . . . . . . . 9 (𝜑 → (𝐵m {𝐴}) ∈ V)
98, 1ssexd 5277 . . . . . . . 8 (𝜑𝐶 ∈ V)
10 rnexg 7877 . . . . . . . . 9 (𝑓𝐶 → ran 𝑓 ∈ V)
1110rgen 3077 . . . . . . . 8 𝑓𝐶 ran 𝑓 ∈ V
12 iunexg 7938 . . . . . . . 8 ((𝐶 ∈ V ∧ ∀𝑓𝐶 ran 𝑓 ∈ V) → 𝑓𝐶 ran 𝑓 ∈ V)
139, 11, 12sylancl 595 . . . . . . 7 (𝜑 𝑓𝐶 ran 𝑓 ∈ V)
147, 13eqeltrd 2861 . . . . . 6 (𝜑𝐷 ∈ V)
1514adantr 484 . . . . 5 ((𝜑𝑓𝐶) → 𝐷 ∈ V)
16 ssiun2 5002 . . . . . . . 8 (𝑓𝐶 → ran 𝑓 𝑓𝐶 ran 𝑓)
1716adantl 485 . . . . . . 7 ((𝜑𝑓𝐶) → ran 𝑓 𝑓𝐶 ran 𝑓)
18 ssmapsn.a . . . . . . . . . 10 (𝜑𝐴𝑉)
19 snidg 4616 . . . . . . . . . 10 (𝐴𝑉𝐴 ∈ {𝐴})
2018, 19syl 17 . . . . . . . . 9 (𝜑𝐴 ∈ {𝐴})
2120adantr 484 . . . . . . . 8 ((𝜑𝑓𝐶) → 𝐴 ∈ {𝐴})
225, 21fnfvelrnd 7057 . . . . . . 7 ((𝜑𝑓𝐶) → (𝑓𝐴) ∈ ran 𝑓)
2317, 22sseldd 3935 . . . . . 6 ((𝜑𝑓𝐶) → (𝑓𝐴) ∈ 𝑓𝐶 ran 𝑓)
2423, 6eleqtrrdi 2872 . . . . 5 ((𝜑𝑓𝐶) → (𝑓𝐴) ∈ 𝐷)
255, 15, 24elmapsnd 45741 . . . 4 ((𝜑𝑓𝐶) → 𝑓 ∈ (𝐷m {𝐴}))
2614adantr 484 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝐷 ∈ V)
27 snex 5393 . . . . . . . . 9 {𝐴} ∈ V
2827a1i 11 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → {𝐴} ∈ V)
29 simpr 488 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝑓 ∈ (𝐷m {𝐴}))
3020adantr 484 . . . . . . . 8 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝐴 ∈ {𝐴})
3126, 28, 29, 30fvmap 45735 . . . . . . 7 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → (𝑓𝐴) ∈ 𝐷)
32 rneq 5908 . . . . . . . . 9 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
3332cbviunv 4993 . . . . . . . 8 𝑓𝐶 ran 𝑓 = 𝑔𝐶 ran 𝑔
346, 33eqtri 2784 . . . . . . 7 𝐷 = 𝑔𝐶 ran 𝑔
3531, 34eleqtrdi 2871 . . . . . 6 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → (𝑓𝐴) ∈ 𝑔𝐶 ran 𝑔)
36 eliun 4950 . . . . . 6 ((𝑓𝐴) ∈ 𝑔𝐶 ran 𝑔 ↔ ∃𝑔𝐶 (𝑓𝐴) ∈ ran 𝑔)
3735, 36sylib 220 . . . . 5 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → ∃𝑔𝐶 (𝑓𝐴) ∈ ran 𝑔)
38 simp3 1150 . . . . . . . 8 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → (𝑓𝐴) ∈ ran 𝑔)
39 simp1l 1210 . . . . . . . . . 10 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝜑)
4039, 18syl 17 . . . . . . . . 9 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝐴𝑉)
41 eqid 2761 . . . . . . . . 9 {𝐴} = {𝐴}
42 simp1r 1211 . . . . . . . . . 10 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓 ∈ (𝐷m {𝐴}))
43 elmapfn 8839 . . . . . . . . . 10 (𝑓 ∈ (𝐷m {𝐴}) → 𝑓 Fn {𝐴})
4442, 43syl 17 . . . . . . . . 9 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓 Fn {𝐴})
451sselda 3934 . . . . . . . . . . . 12 ((𝜑𝑔𝐶) → 𝑔 ∈ (𝐵m {𝐴}))
46 elmapfn 8839 . . . . . . . . . . . 12 (𝑔 ∈ (𝐵m {𝐴}) → 𝑔 Fn {𝐴})
4745, 46syl 17 . . . . . . . . . . 11 ((𝜑𝑔𝐶) → 𝑔 Fn {𝐴})
48473adant3 1144 . . . . . . . . . 10 ((𝜑𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
49483adant1r 1190 . . . . . . . . 9 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
5040, 41, 44, 49fsneqrn 45747 . . . . . . . 8 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → (𝑓 = 𝑔 ↔ (𝑓𝐴) ∈ ran 𝑔))
5138, 50mpbird 259 . . . . . . 7 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓 = 𝑔)
52 simp2 1149 . . . . . . 7 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑔𝐶)
5351, 52eqeltrd 2861 . . . . . 6 (((𝜑𝑓 ∈ (𝐷m {𝐴})) ∧ 𝑔𝐶 ∧ (𝑓𝐴) ∈ ran 𝑔) → 𝑓𝐶)
5453rexlimdv3a 3166 . . . . 5 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → (∃𝑔𝐶 (𝑓𝐴) ∈ ran 𝑔𝑓𝐶))
5537, 54mpd 15 . . . 4 ((𝜑𝑓 ∈ (𝐷m {𝐴})) → 𝑓𝐶)
5625, 55impbida 810 . . 3 (𝜑 → (𝑓𝐶𝑓 ∈ (𝐷m {𝐴})))
5756alrimiv 1946 . 2 (𝜑 → ∀𝑓(𝑓𝐶𝑓 ∈ (𝐷m {𝐴})))
58 nfcv 2923 . . 3 𝑓𝐶
59 ssmapsn.f . . . 4 𝑓𝐷
60 nfcv 2923 . . . 4 𝑓m
61 nfcv 2923 . . . 4 𝑓{𝐴}
6259, 60, 61nfov 7420 . . 3 𝑓(𝐷m {𝐴})
6358, 62cleqf 2951 . 2 (𝐶 = (𝐷m {𝐴}) ↔ ∀𝑓(𝑓𝐶𝑓 ∈ (𝐷m {𝐴})))
6457, 63sylibr 236 1 (𝜑𝐶 = (𝐷m {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1097  wal 1557   = wceq 1559  wcel 2141  wnfc 2908  wral 3075  wrex 3085  Vcvv 3453  wss 3902  {csn 4579   ciun 4946  ran crn 5644   Fn wfn 6510  wf 6511  cfv 6515  (class class class)co 7390  m cmap 8801
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7964  df-2nd 7965  df-map 8803
This theorem is referenced by:  vonvolmbllem  47194  vonvolmbl2  47197  vonvol2  47198
  Copyright terms: Public domain W3C validator