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 46198
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 3931 . . . . . . 7 ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 ∈ (𝐵 ↑m {𝐴}))
3 elmapi 8862 . . . . . . 7 (𝑓 ∈ (𝐵 ↑m {𝐴}) → 𝑓:{𝐴}⟶𝐵)
42, 3syl 18 . . . . . 6 ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓:{𝐴}⟶𝐵)
54ffnd 6708 . . . . 5 ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 Fn {𝐴})
6 ssmapsn.d . . . . . . . 8 𝐷 = ∪ 𝑓 ∈ 𝐶 ran 𝑓
76a1i 11 . . . . . . 7 (𝜑 → 𝐷 = ∪ 𝑓 ∈ 𝐶 ran 𝑓)
8 ovexd 7453 . . . . . . . . 9 (𝜑 → (𝐵 ↑m {𝐴}) ∈ V)
98, 1ssexd 5286 . . . . . . . 8 (𝜑 → 𝐶 ∈ V)
10 rnexg 7912 . . . . . . . . 9 (𝑓 ∈ 𝐶 → ran 𝑓 ∈ V)
1110rgen 3079 . . . . . . . 8 ∀𝑓 ∈ 𝐶 ran 𝑓 ∈ V
12 iunexg 7973 . . . . . . . 8 ((𝐶 ∈ V ∧ ∀𝑓 ∈ 𝐶 ran 𝑓 ∈ V) → ∪ 𝑓 ∈ 𝐶 ran 𝑓 ∈ V)
139, 11, 12sylancl 598 . . . . . . 7 (𝜑 → ∪ 𝑓 ∈ 𝐶 ran 𝑓 ∈ V)
147, 13eqeltrd 2861 . . . . . 6 (𝜑 → 𝐷 ∈ V)
1514adantr 486 . . . . 5 ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝐷 ∈ V)
16 ssiun2 5006 . . . . . . . 8 (𝑓 ∈ 𝐶 → ran 𝑓 ⊆ ∪ 𝑓 ∈ 𝐶 ran 𝑓)
1716adantl 487 . . . . . . 7 ((𝜑 ∧ 𝑓 ∈ 𝐶) → ran 𝑓 ⊆ ∪ 𝑓 ∈ 𝐶 ran 𝑓)
18 ssmapsn.a . . . . . . . . . 10 (𝜑 → 𝐴 ∈ 𝑉)
19 snidg 4621 . . . . . . . . . 10 (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴})
2018, 19syl 18 . . . . . . . . 9 (𝜑 → 𝐴 ∈ {𝐴})
2120adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝐴 ∈ {𝐴})
225, 21fnfvelrnd 7080 . . . . . . 7 ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝑓‘𝐴) ∈ ran 𝑓)
2317, 22sseldd 3932 . . . . . 6 ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝑓‘𝐴) ∈ ∪ 𝑓 ∈ 𝐶 ran 𝑓)
2423, 6eleqtrrdi 2872 . . . . 5 ((𝜑 ∧ 𝑓 ∈ 𝐶) → (𝑓‘𝐴) ∈ 𝐷)
255, 15, 24elmapsnd 46187 . . . 4 ((𝜑 ∧ 𝑓 ∈ 𝐶) → 𝑓 ∈ (𝐷 ↑m {𝐴}))
2614adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝐷 ∈ V)
27 snex 5397 . . . . . . . . 9 {𝐴} ∈ V
2827a1i 11 . . . . . . . 8 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → {𝐴} ∈ V)
29 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝑓 ∈ (𝐷 ↑m {𝐴}))
3020adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝐴 ∈ {𝐴})
3126, 28, 29, 30fvmap 46181 . . . . . . 7 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (𝑓‘𝐴) ∈ 𝐷)
32 rneq 5918 . . . . . . . . 9 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
3332cbviunv 4997 . . . . . . . 8 ∪ 𝑓 ∈ 𝐶 ran 𝑓 = ∪ 𝑔 ∈ 𝐶 ran 𝑔
346, 33eqtri 2784 . . . . . . 7 𝐷 = ∪ 𝑔 ∈ 𝐶 ran 𝑔
3531, 34eleqtrdi 2871 . . . . . 6 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (𝑓‘𝐴) ∈ ∪ 𝑔 ∈ 𝐶 ran 𝑔)
36 eliun 4955 . . . . . 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 2761 . . . . . . . . 9 {𝐴} = {𝐴}
42 simp1r 1217 . . . . . . . . . 10 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 ∈ (𝐷 ↑m {𝐴}))
43 elmapfn 8880 . . . . . . . . . 10 (𝑓 ∈ (𝐷 ↑m {𝐴}) → 𝑓 Fn {𝐴})
4442, 43syl 18 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 Fn {𝐴})
451sselda 3931 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑔 ∈ 𝐶) → 𝑔 ∈ (𝐵 ↑m {𝐴}))
46 elmapfn 8880 . . . . . . . . . . . 12 (𝑔 ∈ (𝐵 ↑m {𝐴}) → 𝑔 Fn {𝐴})
4745, 46syl 18 . . . . . . . . . . 11 ((𝜑 ∧ 𝑔 ∈ 𝐶) → 𝑔 Fn {𝐴})
48473adant3 1150 . . . . . . . . . 10 ((𝜑 ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
49483adant1r 1196 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑔 Fn {𝐴})
5040, 41, 44, 49fsneqrn 46193 . . . . . . . 8 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → (𝑓 = 𝑔 ↔ (𝑓‘𝐴) ∈ ran 𝑔))
5138, 50mpbird 260 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 = 𝑔)
52 simp2 1155 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑔 ∈ 𝐶)
5351, 52eqeltrd 2861 . . . . . 6 (((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) ∧ 𝑔 ∈ 𝐶 ∧ (𝑓‘𝐴) ∈ ran 𝑔) → 𝑓 ∈ 𝐶)
5453rexlimdv3a 3168 . . . . 5 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → (∃𝑔 ∈ 𝐶 (𝑓‘𝐴) ∈ ran 𝑔 → 𝑓 ∈ 𝐶))
5537, 54mpd 16 . . . 4 ((𝜑 ∧ 𝑓 ∈ (𝐷 ↑m {𝐴})) → 𝑓 ∈ 𝐶)
5625, 55impbida 813 . . 3 (𝜑 → (𝑓 ∈ 𝐶 ↔ 𝑓 ∈ (𝐷 ↑m {𝐴})))
5756alrimiv 1960 . 2 (𝜑 → ∀𝑓(𝑓 ∈ 𝐶 ↔ 𝑓 ∈ (𝐷 ↑m {𝐴})))
58 nfcv 2923 . . 3 Ⅎ𝑓𝐶
59 ssmapsn.f . . . 4 Ⅎ𝑓𝐷
60 nfcv 2923 . . . 4 Ⅎ𝑓 ↑m
61 nfcv 2923 . . . 4 Ⅎ𝑓{𝐴}
6259, 60, 61nfov 7448 . . 3 Ⅎ𝑓(𝐷 ↑m {𝐴})
6358, 62cleqf 2951 . 2 (𝐶 = (𝐷 ↑m {𝐴}) ↔ ∀𝑓(𝑓 ∈ 𝐶 ↔ 𝑓 ∈ (𝐷 ↑m {𝐴})))
6457, 63sylibr 237 1 (𝜑 → 𝐶 = (𝐷 ↑m {𝐴}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  {csn 4584  ∪ ciun 4951  ran crn 5652   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ↑m cmap 8840
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-map 8842
This theorem is used by:  vonvolmbllem  47639  vonvolmbl2  47642  vonvol2  47643
  Copyright terms: Public domain W3C validator