Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  reprinrn Structured version   Visualization version   GIF version

Theorem reprinrn 31005
 Description: Representations with term in an intersection. (Contributed by Thierry Arnoux, 11-Dec-2021.)
Hypotheses
Ref Expression
reprval.a (𝜑𝐴 ⊆ ℕ)
reprval.m (𝜑𝑀 ∈ ℤ)
reprval.s (𝜑𝑆 ∈ ℕ0)
Assertion
Ref Expression
reprinrn (𝜑 → (𝑐 ∈ ((𝐴𝐵)(repr‘𝑆)𝑀) ↔ (𝑐 ∈ (𝐴(repr‘𝑆)𝑀) ∧ ran 𝑐𝐵)))
Distinct variable groups:   𝐴,𝑐   𝑀,𝑐   𝑆,𝑐   𝜑,𝑐   𝐵,𝑐

Proof of Theorem reprinrn
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 fin 6246 . . . . 5 (𝑐:(0..^𝑆)⟶(𝐴𝐵) ↔ (𝑐:(0..^𝑆)⟶𝐴𝑐:(0..^𝑆)⟶𝐵))
2 df-f 6053 . . . . . . 7 (𝑐:(0..^𝑆)⟶𝐵 ↔ (𝑐 Fn (0..^𝑆) ∧ ran 𝑐𝐵))
3 ffn 6206 . . . . . . . . . 10 (𝑐:(0..^𝑆)⟶𝐴𝑐 Fn (0..^𝑆))
43adantl 473 . . . . . . . . 9 ((𝜑𝑐:(0..^𝑆)⟶𝐴) → 𝑐 Fn (0..^𝑆))
54biantrurd 530 . . . . . . . 8 ((𝜑𝑐:(0..^𝑆)⟶𝐴) → (ran 𝑐𝐵 ↔ (𝑐 Fn (0..^𝑆) ∧ ran 𝑐𝐵)))
65bicomd 213 . . . . . . 7 ((𝜑𝑐:(0..^𝑆)⟶𝐴) → ((𝑐 Fn (0..^𝑆) ∧ ran 𝑐𝐵) ↔ ran 𝑐𝐵))
72, 6syl5bb 272 . . . . . 6 ((𝜑𝑐:(0..^𝑆)⟶𝐴) → (𝑐:(0..^𝑆)⟶𝐵 ↔ ran 𝑐𝐵))
87pm5.32da 676 . . . . 5 (𝜑 → ((𝑐:(0..^𝑆)⟶𝐴𝑐:(0..^𝑆)⟶𝐵) ↔ (𝑐:(0..^𝑆)⟶𝐴 ∧ ran 𝑐𝐵)))
91, 8syl5bb 272 . . . 4 (𝜑 → (𝑐:(0..^𝑆)⟶(𝐴𝐵) ↔ (𝑐:(0..^𝑆)⟶𝐴 ∧ ran 𝑐𝐵)))
10 nnex 11218 . . . . . . . 8 ℕ ∈ V
1110a1i 11 . . . . . . 7 (𝜑 → ℕ ∈ V)
12 reprval.a . . . . . . 7 (𝜑𝐴 ⊆ ℕ)
1311, 12ssexd 4957 . . . . . 6 (𝜑𝐴 ∈ V)
14 inex1g 4953 . . . . . 6 (𝐴 ∈ V → (𝐴𝐵) ∈ V)
1513, 14syl 17 . . . . 5 (𝜑 → (𝐴𝐵) ∈ V)
16 ovex 6841 . . . . 5 (0..^𝑆) ∈ V
17 elmapg 8036 . . . . 5 (((𝐴𝐵) ∈ V ∧ (0..^𝑆) ∈ V) → (𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ↔ 𝑐:(0..^𝑆)⟶(𝐴𝐵)))
1815, 16, 17sylancl 697 . . . 4 (𝜑 → (𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ↔ 𝑐:(0..^𝑆)⟶(𝐴𝐵)))
19 elmapg 8036 . . . . . 6 ((𝐴 ∈ V ∧ (0..^𝑆) ∈ V) → (𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ↔ 𝑐:(0..^𝑆)⟶𝐴))
2013, 16, 19sylancl 697 . . . . 5 (𝜑 → (𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ↔ 𝑐:(0..^𝑆)⟶𝐴))
2120anbi1d 743 . . . 4 (𝜑 → ((𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ ran 𝑐𝐵) ↔ (𝑐:(0..^𝑆)⟶𝐴 ∧ ran 𝑐𝐵)))
229, 18, 213bitr4d 300 . . 3 (𝜑 → (𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ↔ (𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ ran 𝑐𝐵)))
2322anbi1d 743 . 2 (𝜑 → ((𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀) ↔ ((𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ ran 𝑐𝐵) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀)))
24 inss1 3976 . . . . . 6 (𝐴𝐵) ⊆ 𝐴
2524, 12syl5ss 3755 . . . . 5 (𝜑 → (𝐴𝐵) ⊆ ℕ)
26 reprval.m . . . . 5 (𝜑𝑀 ∈ ℤ)
27 reprval.s . . . . 5 (𝜑𝑆 ∈ ℕ0)
2825, 26, 27reprval 30997 . . . 4 (𝜑 → ((𝐴𝐵)(repr‘𝑆)𝑀) = {𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ∣ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀})
2928eleq2d 2825 . . 3 (𝜑 → (𝑐 ∈ ((𝐴𝐵)(repr‘𝑆)𝑀) ↔ 𝑐 ∈ {𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ∣ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀}))
30 rabid 3254 . . 3 (𝑐 ∈ {𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ∣ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀} ↔ (𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀))
3129, 30syl6bb 276 . 2 (𝜑 → (𝑐 ∈ ((𝐴𝐵)(repr‘𝑆)𝑀) ↔ (𝑐 ∈ ((𝐴𝐵) ↑𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀)))
3212, 26, 27reprval 30997 . . . . . 6 (𝜑 → (𝐴(repr‘𝑆)𝑀) = {𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∣ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀})
3332eleq2d 2825 . . . . 5 (𝜑 → (𝑐 ∈ (𝐴(repr‘𝑆)𝑀) ↔ 𝑐 ∈ {𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∣ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀}))
34 rabid 3254 . . . . 5 (𝑐 ∈ {𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∣ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀} ↔ (𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀))
3533, 34syl6bb 276 . . . 4 (𝜑 → (𝑐 ∈ (𝐴(repr‘𝑆)𝑀) ↔ (𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀)))
3635anbi1d 743 . . 3 (𝜑 → ((𝑐 ∈ (𝐴(repr‘𝑆)𝑀) ∧ ran 𝑐𝐵) ↔ ((𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀) ∧ ran 𝑐𝐵)))
37 an32 874 . . 3 (((𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀) ∧ ran 𝑐𝐵) ↔ ((𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ ran 𝑐𝐵) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀))
3836, 37syl6bb 276 . 2 (𝜑 → ((𝑐 ∈ (𝐴(repr‘𝑆)𝑀) ∧ ran 𝑐𝐵) ↔ ((𝑐 ∈ (𝐴𝑚 (0..^𝑆)) ∧ ran 𝑐𝐵) ∧ Σ𝑎 ∈ (0..^𝑆)(𝑐𝑎) = 𝑀)))
3923, 31, 383bitr4d 300 1 (𝜑 → (𝑐 ∈ ((𝐴𝐵)(repr‘𝑆)𝑀) ↔ (𝑐 ∈ (𝐴(repr‘𝑆)𝑀) ∧ ran 𝑐𝐵)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1632   ∈ wcel 2139  {crab 3054  Vcvv 3340   ∩ cin 3714   ⊆ wss 3715  ran crn 5267   Fn wfn 6044  ⟶wf 6045  ‘cfv 6049  (class class class)co 6813   ↑𝑚 cmap 8023  0cc0 10128  ℕcn 11212  ℕ0cn0 11484  ℤcz 11569  ..^cfzo 12659  Σcsu 14615  reprcrepr 30995 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-cnex 10184  ax-resscn 10185  ax-1cn 10186  ax-icn 10187  ax-addcl 10188  ax-addrcl 10189  ax-mulcl 10190  ax-mulrcl 10191  ax-i2m1 10196  ax-1ne0 10197  ax-rrecex 10200  ax-cnre 10201 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-om 7231  df-1st 7333  df-2nd 7334  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-map 8025  df-neg 10461  df-nn 11213  df-z 11570  df-seq 12996  df-sum 14616  df-repr 30996 This theorem is referenced by:  hashreprin  31007
 Copyright terms: Public domain W3C validator