MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  smueqlem Structured version   Visualization version   GIF version
Theorem smueqlem 16543
Description: Any element of a sequence multiplication only depends on the values of the argument sequences up to and including that point. (Contributed by Mario Carneiro, 20-Sep-2016.)
Hypotheses
Ref Expression
smueq.a (𝜑 → 𝐴 ⊆ ℕ0)
smueq.b (𝜑 → 𝐵 ⊆ ℕ0)
smueq.n (𝜑 → 𝑁 ∈ ℕ0)
smueq.p 𝑃 = seq0((𝑝 ∈ 𝒫 ℕ0, 𝑚 ∈ ℕ0 ↦ (𝑝 sadd {𝑛 ∈ ℕ0 ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ 𝐵)})), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
smueq.q 𝑄 = seq0((𝑝 ∈ 𝒫 ℕ0, 𝑚 ∈ ℕ0 ↦ (𝑝 sadd {𝑛 ∈ ℕ0 ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ (𝐵 ∩ (0..^𝑁)))})), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
Assertion
Ref Expression
smueqlem (𝜑 → ((𝐴 smul 𝐵) ∩ (0..^𝑁)) = (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁)))
Distinct variable groups:   𝑚,𝑛,𝑝,𝐴   𝐵,𝑚,𝑛,𝑝   𝑚,𝑁,𝑛,𝑝   𝜑,𝑛
Allowed substitution hints:   𝜑(𝑚,𝑝)   𝑃(𝑚,𝑛,𝑝)   𝑄(𝑚,𝑛,𝑝)
Proof of Theorem smueqlem
Dummy variables 𝑘 𝑖 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 smueq.a . . . . . . . 8 (𝜑 → 𝐴 ⊆ ℕ0)
21adantr 485 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝐴 ⊆ ℕ0)
3 smueq.b . . . . . . . 8 (𝜑 → 𝐵 ⊆ ℕ0)
43adantr 485 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝐵 ⊆ ℕ0)
5 smueq.p . . . . . . 7 𝑃 = seq0((𝑝 ∈ 𝒫 ℕ0, 𝑚 ∈ ℕ0 ↦ (𝑝 sadd {𝑛 ∈ ℕ0 ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ 𝐵)})), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
6 elfzouz 13688 . . . . . . . . 9 (𝑘 ∈ (0..^𝑁) → 𝑘 ∈ (ℤ≥‘0))
76adantl 486 . . . . . . . 8 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ (ℤ≥‘0))
8 nn0uz 12895 . . . . . . . 8 ℕ0 = (ℤ≥‘0)
97, 8eleqtrrdi 2874 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ ℕ0)
109nn0zd 12611 . . . . . . . . 9 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ ℤ)
1110peano2zd 12698 . . . . . . . 8 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 + 1) ∈ ℤ)
12 smueq.n . . . . . . . . . 10 (𝜑 → 𝑁 ∈ ℕ0)
1312adantr 485 . . . . . . . . 9 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ0)
1413nn0zd 12611 . . . . . . . 8 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ∈ ℤ)
15 elfzolt2 13693 . . . . . . . . . 10 (𝑘 ∈ (0..^𝑁) → 𝑘 < 𝑁)
1615adantl 486 . . . . . . . . 9 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 < 𝑁)
17 nn0ltp1le 12649 . . . . . . . . . 10 ((𝑘 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑘 < 𝑁 ↔ (𝑘 + 1) ≤ 𝑁))
189, 13, 17syl2anc 595 . . . . . . . . 9 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 < 𝑁 ↔ (𝑘 + 1) ≤ 𝑁))
1916, 18mpbid 235 . . . . . . . 8 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 + 1) ≤ 𝑁)
20 eluz2 12863 . . . . . . . 8 (𝑁 ∈ (ℤ≥‘(𝑘 + 1)) ↔ ((𝑘 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑁))
2111, 14, 19, 20syl3anbrc 1362 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ∈ (ℤ≥‘(𝑘 + 1)))
222, 4, 5, 9, 21smuval2 16535 . . . . . 6 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝐴 smul 𝐵) ↔ 𝑘 ∈ (𝑃‘𝑁)))
2312, 8eleqtrdi 2873 . . . . . . . . . . 11 (𝜑 → 𝑁 ∈ (ℤ≥‘0))
24 eluzfz2b 13556 . . . . . . . . . . 11 (𝑁 ∈ (ℤ≥‘0) ↔ 𝑁 ∈ (0...𝑁))
2523, 24sylib 221 . . . . . . . . . 10 (𝜑 → 𝑁 ∈ (0...𝑁))
26 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = 0 → (𝑃‘𝑥) = (𝑃‘0))
2726ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = 0 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘0) ∩ (0..^𝑁)))
28 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = 0 → (𝑄‘𝑥) = (𝑄‘0))
2928ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = 0 → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁)))
3027, 29eqeq12d 2779 . . . . . . . . . . . 12 (𝑥 = 0 → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁))))
3130imbi2d 343 . . . . . . . . . . 11 (𝑥 = 0 → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁)))))
32 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = 𝑖 → (𝑃‘𝑥) = (𝑃‘𝑖))
3332ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = 𝑖 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘𝑖) ∩ (0..^𝑁)))
34 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = 𝑖 → (𝑄‘𝑥) = (𝑄‘𝑖))
3534ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = 𝑖 → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)))
3633, 35eqeq12d 2779 . . . . . . . . . . . 12 (𝑥 = 𝑖 → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁))))
3736imbi2d 343 . . . . . . . . . . 11 (𝑥 = 𝑖 → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)))))
38 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = (𝑖 + 1) → (𝑃‘𝑥) = (𝑃‘(𝑖 + 1)))
3938ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = (𝑖 + 1) → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)))
40 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = (𝑖 + 1) → (𝑄‘𝑥) = (𝑄‘(𝑖 + 1)))
4140ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = (𝑖 + 1) → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))
4239, 41eqeq12d 2779 . . . . . . . . . . . 12 (𝑥 = (𝑖 + 1) → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁))))
4342imbi2d 343 . . . . . . . . . . 11 (𝑥 = (𝑖 + 1) → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))))
44 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = 𝑁 → (𝑃‘𝑥) = (𝑃‘𝑁))
4544ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = 𝑁 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘𝑁) ∩ (0..^𝑁)))
46 fveq2 6881 . . . . . . . . . . . . . 14 (𝑥 = 𝑁 → (𝑄‘𝑥) = (𝑄‘𝑁))
4746ineq1d 4172 . . . . . . . . . . . . 13 (𝑥 = 𝑁 → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))
4845, 47eqeq12d 2779 . . . . . . . . . . . 12 (𝑥 = 𝑁 → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁))))
4948imbi2d 343 . . . . . . . . . . 11 (𝑥 = 𝑁 → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))))
501, 3, 5smup0 16532 . . . . . . . . . . . . . 14 (𝜑 → (𝑃‘0) = ∅)
51 inss1 4189 . . . . . . . . . . . . . . . 16 (𝐵 ∩ (0..^𝑁)) ⊆ 𝐵
5251, 3sstrid 3948 . . . . . . . . . . . . . . 15 (𝜑 → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ0)
53 smueq.q . . . . . . . . . . . . . . 15 𝑄 = seq0((𝑝 ∈ 𝒫 ℕ0, 𝑚 ∈ ℕ0 ↦ (𝑝 sadd {𝑛 ∈ ℕ0 ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ (𝐵 ∩ (0..^𝑁)))})), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
541, 52, 53smup0 16532 . . . . . . . . . . . . . 14 (𝜑 → (𝑄‘0) = ∅)
5550, 54eqtr4d 2801 . . . . . . . . . . . . 13 (𝜑 → (𝑃‘0) = (𝑄‘0))
5655ineq1d 4172 . . . . . . . . . . . 12 (𝜑 → ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁)))
5756a1i 11 . . . . . . . . . . 11 (𝑁 ∈ (ℤ≥‘0) → (𝜑 → ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁))))
58 oveq1 7417 . . . . . . . . . . . . . . 15 (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → (((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) = (((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))))
5958ineq1d 4172 . . . . . . . . . . . . . 14 (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
601adantr 485 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝐴 ⊆ ℕ0)
613adantr 485 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝐵 ⊆ ℕ0)
62 elfzonn0 13732 . . . . . . . . . . . . . . . . . . 19 (𝑖 ∈ (0..^𝑁) → 𝑖 ∈ ℕ0)
6362adantl 486 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝑖 ∈ ℕ0)
6460, 61, 5, 63smupp1 16533 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑃‘(𝑖 + 1)) = ((𝑃‘𝑖) sadd {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}))
6564ineq1d 4172 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = (((𝑃‘𝑖) sadd {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}) ∩ (0..^𝑁)))
661, 3, 5smupf 16531 . . . . . . . . . . . . . . . . . . 19 (𝜑 → 𝑃:ℕ0⟶𝒫 ℕ0)
67 ffvelcdm 7076 . . . . . . . . . . . . . . . . . . 19 ((𝑃:ℕ0⟶𝒫 ℕ0 ∧ 𝑖 ∈ ℕ0) → (𝑃‘𝑖) ∈ 𝒫 ℕ0)
6866, 62, 67syl2an 607 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑃‘𝑖) ∈ 𝒫 ℕ0)
6968elpwid 4571 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑃‘𝑖) ⊆ ℕ0)
70 ssrab2 4034 . . . . . . . . . . . . . . . . . 18 {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ⊆ ℕ0
7170a1i 11 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ⊆ ℕ0)
7212adantr 485 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ0)
7369, 71, 72sadeq 16525 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑃‘𝑖) sadd {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}) ∩ (0..^𝑁)) = ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
7465, 73eqtrd 2798 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
7552adantr 485 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ0)
7660, 75, 53, 63smupp1 16533 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑄‘(𝑖 + 1)) = ((𝑄‘𝑖) sadd {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}))
7776ineq1d 4172 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)) = (((𝑄‘𝑖) sadd {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}) ∩ (0..^𝑁)))
781, 52, 53smupf 16531 . . . . . . . . . . . . . . . . . . 19 (𝜑 → 𝑄:ℕ0⟶𝒫 ℕ0)
79 ffvelcdm 7076 . . . . . . . . . . . . . . . . . . 19 ((𝑄:ℕ0⟶𝒫 ℕ0 ∧ 𝑖 ∈ ℕ0) → (𝑄‘𝑖) ∈ 𝒫 ℕ0)
8078, 62, 79syl2an 607 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑄‘𝑖) ∈ 𝒫 ℕ0)
8180elpwid 4571 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑄‘𝑖) ⊆ ℕ0)
82 ssrab2 4034 . . . . . . . . . . . . . . . . . 18 {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ⊆ ℕ0
8382a1i 11 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ⊆ ℕ0)
8481, 83, 72sadeq 16525 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑄‘𝑖) sadd {𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
85 elinel2 4155 . . . . . . . . . . . . . . . . . . . . 21 (𝑛 ∈ (ℕ0 ∩ (0..^𝑁)) → 𝑛 ∈ (0..^𝑁))
8661adantr 485 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝐵 ⊆ ℕ0)
8786sseld 3936 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ 𝐵 → (𝑛 − 𝑖) ∈ ℕ0))
88 elfzo0 13725 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (𝑛 ∈ (0..^𝑁) ↔ (𝑛 ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ 𝑛 < 𝑁))
8988simp2bi 1164 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (𝑛 ∈ (0..^𝑁) → 𝑁 ∈ ℕ)
9089adantl 486 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ)
91 elfzonn0 13732 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 (𝑛 ∈ (0..^𝑁) → 𝑛 ∈ ℕ0)
9291adantl 486 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑛 ∈ ℕ0)
9392nn0red 12561 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑛 ∈ ℝ)
9463adantr 485 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑖 ∈ ℕ0)
9594nn0red 12561 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑖 ∈ ℝ)
9693, 95resubcld 11637 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑛 − 𝑖) ∈ ℝ)
9790nnred 12243 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑁 ∈ ℝ)
9894nn0ge0d 12563 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 0 ≤ 𝑖)
9993, 95subge02d 11801 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (0 ≤ 𝑖 ↔ (𝑛 − 𝑖) ≤ 𝑛))
10098, 99mpbid 235 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑛 − 𝑖) ≤ 𝑛)
101 elfzolt2 13693 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 (𝑛 ∈ (0..^𝑁) → 𝑛 < 𝑁)
102101adantl 486 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑛 < 𝑁)
10396, 93, 97, 100, 102lelttrd 11363 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑛 − 𝑖) < 𝑁)
10490, 103jca 520 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁))
105 elfzo0 13725 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ((𝑛 − 𝑖) ∈ (0..^𝑁) ↔ ((𝑛 − 𝑖) ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁))
106 3anass 1111 . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 (((𝑛 − 𝑖) ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁) ↔ ((𝑛 − 𝑖) ∈ ℕ0 ∧ (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁)))
107105, 106bitri 278 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ((𝑛 − 𝑖) ∈ (0..^𝑁) ↔ ((𝑛 − 𝑖) ∈ ℕ0 ∧ (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁)))
108107baib 544 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝑛 − 𝑖) ∈ ℕ0 → ((𝑛 − 𝑖) ∈ (0..^𝑁) ↔ (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁)))
109104, 108syl5ibrcom 250 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ ℕ0 → (𝑛 − 𝑖) ∈ (0..^𝑁)))
11087, 109syld 48 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ 𝐵 → (𝑛 − 𝑖) ∈ (0..^𝑁)))
111110pm4.71rd 571 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ 𝐵 ↔ ((𝑛 − 𝑖) ∈ (0..^𝑁) ∧ (𝑛 − 𝑖) ∈ 𝐵)))
112 ancom 465 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝑛 − 𝑖) ∈ (0..^𝑁) ∧ (𝑛 − 𝑖) ∈ 𝐵) ↔ ((𝑛 − 𝑖) ∈ 𝐵 ∧ (𝑛 − 𝑖) ∈ (0..^𝑁)))
113 elin 3921 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)) ↔ ((𝑛 − 𝑖) ∈ 𝐵 ∧ (𝑛 − 𝑖) ∈ (0..^𝑁)))
114112, 113bitr4i 281 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑛 − 𝑖) ∈ (0..^𝑁) ∧ (𝑛 − 𝑖) ∈ 𝐵) ↔ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))
115111, 114bitr2di 291 . . . . . . . . . . . . . . . . . . . . . 22 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)) ↔ (𝑛 − 𝑖) ∈ 𝐵))
116115anbi2d 641 . . . . . . . . . . . . . . . . . . . . 21 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁))) ↔ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)))
11785, 116sylan2 604 . . . . . . . . . . . . . . . . . . . 20 (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (ℕ0 ∩ (0..^𝑁))) → ((𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁))) ↔ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)))
118117rabbidva 3422 . . . . . . . . . . . . . . . . . . 19 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → {𝑛 ∈ (ℕ0 ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} = {𝑛 ∈ (ℕ0 ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)})
119 inrab2 4270 . . . . . . . . . . . . . . . . . . 19 ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁)) = {𝑛 ∈ (ℕ0 ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}
120 inrab2 4270 . . . . . . . . . . . . . . . . . . 19 ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁)) = {𝑛 ∈ (ℕ0 ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}
121118, 119, 1203eqtr4g 2823 . . . . . . . . . . . . . . . . . 18 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁)) = ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁)))
122121oveq2d 7426 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁))) = (((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))))
123122ineq1d 4172 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁))) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
12477, 84, 1233eqtrd 2802 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
12574, 124eqeq12d 2779 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)) ↔ ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ0 ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁))))
12659, 125imbitrrid 249 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁))))
127126expcom 418 . . . . . . . . . . . 12 (𝑖 ∈ (0..^𝑁) → (𝜑 → (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))))
128127a2d 30 . . . . . . . . . . 11 (𝑖 ∈ (0..^𝑁) → ((𝜑 → ((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁))) → (𝜑 → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))))
12931, 37, 43, 49, 57, 128fzind2 13813 . . . . . . . . . 10 (𝑁 ∈ (0...𝑁) → (𝜑 → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁))))
13025, 129mpcom 39 . . . . . . . . 9 (𝜑 → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))
131130adantr 485 . . . . . . . 8 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))
132131eleq2d 2849 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁))))
133 elin 3921 . . . . . . . . 9 (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ (𝑘 ∈ (𝑃‘𝑁) ∧ 𝑘 ∈ (0..^𝑁)))
134133rbaib 547 . . . . . . . 8 (𝑘 ∈ (0..^𝑁) → (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑃‘𝑁)))
135134adantl 486 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑃‘𝑁)))
136 elin 3921 . . . . . . . . 9 (𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁)) ↔ (𝑘 ∈ (𝑄‘𝑁) ∧ 𝑘 ∈ (0..^𝑁)))
137136rbaib 547 . . . . . . . 8 (𝑘 ∈ (0..^𝑁) → (𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑄‘𝑁)))
138137adantl 486 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑄‘𝑁)))
139132, 135, 1383bitr3d 312 . . . . . 6 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝑃‘𝑁) ↔ 𝑘 ∈ (𝑄‘𝑁)))
14052adantr 485 . . . . . . . 8 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ0)
1412, 140, 53, 13smupval 16541 . . . . . . 7 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑄‘𝑁) = ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))))
142141eleq2d 2849 . . . . . 6 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝑄‘𝑁) ↔ 𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁)))))
14322, 139, 1423bitrd 308 . . . . 5 ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝐴 smul 𝐵) ↔ 𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁)))))
144143ex 417 . . . 4 (𝜑 → (𝑘 ∈ (0..^𝑁) → (𝑘 ∈ (𝐴 smul 𝐵) ↔ 𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))))))
145144pm5.32rd 588 . . 3 (𝜑 → ((𝑘 ∈ (𝐴 smul 𝐵) ∧ 𝑘 ∈ (0..^𝑁)) ↔ (𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∧ 𝑘 ∈ (0..^𝑁))))
146 elin 3921 . . 3 (𝑘 ∈ ((𝐴 smul 𝐵) ∩ (0..^𝑁)) ↔ (𝑘 ∈ (𝐴 smul 𝐵) ∧ 𝑘 ∈ (0..^𝑁)))
147 elin 3921 . . 3 (𝑘 ∈ (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁)) ↔ (𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∧ 𝑘 ∈ (0..^𝑁)))
148145, 146, 1473bitr4g 317 . 2 (𝜑 → (𝑘 ∈ ((𝐴 smul 𝐵) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁))))
149148eqrdv 2761 1 (𝜑 → ((𝐴 smul 𝐵) ∩ (0..^𝑁)) = (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁)))
Colors of variables: wff setvar class
Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  {crab 3416   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286  ifcif 4487  𝒫 cpw 4562   class class class wbr 5109   ↦ cmpt 5192  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ∈ cmpo 7412  0cc0 11095  1c1 11096   + caddc 11098   < clt 11238   ≤ cle 11239   − cmin 11436  ℕcn 12228  ℕ0cn0 12499  ℤcz 12586  ℤ≥cuz 12857  ...cfz 13530  ..^cfzo 13678  seqcseq 14033   sadd csad 16473   smul csmu 16474
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 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172  ax-pre-sup 11173
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-xor 1542  df-tru 1573  df-fal 1583  df-had 1624  df-cad 1637  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-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-disj 5077  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-oadd 8453  df-er 8690  df-map 8822  df-pm 8823  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-inf 9399  df-oi 9468  df-dju 9883  df-card 9921  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-div 11867  df-nn 12229  df-2 12298  df-3 12299  df-n0 12500  df-xnn0 12573  df-z 12587  df-uz 12858  df-rp 13012  df-fz 13531  df-fzo 13679  df-fl 13821  df-mod 13899  df-seq 14034  df-exp 14094  df-hash 14363  df-cj 15146  df-re 15147  df-im 15148  df-sqrt 15282  df-abs 15283  df-clim 15535  df-sum 15734  df-dvds 16306  df-bits 16475  df-sad 16504  df-smu 16529
This theorem is referenced by:  smueq  16544
  Copyright terms: Public domain W3C validator